./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound50.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_unwindbound50.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 26441863cbddcb0f41ea7f2e43c89533e1f12930 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_unwindbound50.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 26441863cbddcb0f41ea7f2e43c89533e1f12930 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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@1b56bc41 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:25:53,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:25:53,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:25:53,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:25:53,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:25:53,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:25:53,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:25:53,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:25:53,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:25:53,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:25:53,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:25:53,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:25:53,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:25:53,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:25:53,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:25:53,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:25:53,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:25:53,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:25:53,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:25:53,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:25:53,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:25:53,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:25:54,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:25:54,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:25:54,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:25:54,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:25:54,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:25:54,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:25:54,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:25:54,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:25:54,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:25:54,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:25:54,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:25:54,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:25:54,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:25:54,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:25:54,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:25:54,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:25:54,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:25:54,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:25:54,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:25:54,013 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:54,037 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:25:54,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:25:54,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:25:54,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:25:54,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:25:54,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:25:54,039 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:25:54,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:25:54,040 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:25:54,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:25:54,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:25:54,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:25:54,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:25:54,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:25:54,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:25:54,041 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:25:54,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:25:54,042 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:25:54,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:25:54,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:25:54,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:25:54,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:25:54,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:25:54,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:25:54,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:25:54,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:25:54,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:25:54,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:25:54,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:25:54,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:25:54,044 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 -> 26441863cbddcb0f41ea7f2e43c89533e1f12930 [2021-09-13 14:25:54,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:25:54,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:25:54,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:25:54,467 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:25:54,468 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:25:54,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2021-09-13 14:25:54,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa8e7ebe/f97d94e77bd34d118714bd7aa2500d17/FLAG211a55a85 [2021-09-13 14:25:55,003 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:25:55,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2021-09-13 14:25:55,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa8e7ebe/f97d94e77bd34d118714bd7aa2500d17/FLAG211a55a85 [2021-09-13 14:25:55,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa8e7ebe/f97d94e77bd34d118714bd7aa2500d17 [2021-09-13 14:25:55,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:25:55,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:25:55,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:25:55,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:25:55,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:25:55,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:55" (1/1) ... [2021-09-13 14:25:55,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522aaeef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:55, skipping insertion in model container [2021-09-13 14:25:55,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:55" (1/1) ... [2021-09-13 14:25:55,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:25:55,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:25:55,210 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_unwindbound50.c[490,503] [2021-09-13 14:25:55,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:25:55,247 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:25:55,257 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_unwindbound50.c[490,503] [2021-09-13 14:25:55,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:25:55,305 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:25:55,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:55 WrapperNode [2021-09-13 14:25:55,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:25:55,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:25:55,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:25:55,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:25:55,312 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:55" (1/1) ... [2021-09-13 14:25:55,317 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:55" (1/1) ... [2021-09-13 14:25:55,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:25:55,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:25:55,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:25:55,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:25:55,348 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:55" (1/1) ... [2021-09-13 14:25:55,348 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:55" (1/1) ... [2021-09-13 14:25:55,350 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:55" (1/1) ... [2021-09-13 14:25:55,350 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:55" (1/1) ... [2021-09-13 14:25:55,356 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:55" (1/1) ... [2021-09-13 14:25:55,367 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:55" (1/1) ... [2021-09-13 14:25:55,370 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:55" (1/1) ... [2021-09-13 14:25:55,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:25:55,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:25:55,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:25:55,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:25:55,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:55" (1/1) ... [2021-09-13 14:25:55,391 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:25:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:55,418 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:55,442 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:55,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:25:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:25:55,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:25:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:25:55,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:25:55,713 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-09-13 14:25:55,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:25:55 BoogieIcfgContainer [2021-09-13 14:25:55,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:25:55,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:25:55,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:25:55,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:25:55,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:25:55" (1/3) ... [2021-09-13 14:25:55,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197d5b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:25:55, skipping insertion in model container [2021-09-13 14:25:55,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:55" (2/3) ... [2021-09-13 14:25:55,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197d5b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:25:55, skipping insertion in model container [2021-09-13 14:25:55,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:25:55" (3/3) ... [2021-09-13 14:25:55,720 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound50.c [2021-09-13 14:25:55,724 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:25:55,724 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:25:55,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:25:55,790 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:55,791 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:25:55,808 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:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:25:55,812 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:55,813 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:55,813 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:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1233339761, now seen corresponding path program 1 times [2021-09-13 14:25:55,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:55,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357586396] [2021-09-13 14:25:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:55,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:55,999 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:56,000 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:56,001 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:56,002 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:56,002 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:56,003 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:56,003 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:25:56,003 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:56,004 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:25:56,004 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:25:56,005 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:56,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:56,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357586396] [2021-09-13 14:25:56,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357586396] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:56,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:56,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:25:56,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855045175] [2021-09-13 14:25:56,014 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:56,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:56,017 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:56,047 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:56,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:25:56,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:25:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:25:56,074 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:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,229 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-09-13 14:25:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:25:56,230 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:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:56,232 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:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:25:56,245 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:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:25:56,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2021-09-13 14:25:56,378 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:56,386 INFO L225 Difference]: With dead ends: 77 [2021-09-13 14:25:56,386 INFO L226 Difference]: Without dead ends: 36 [2021-09-13 14:25:56,388 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:25:56,391 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:56,392 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 69.32ms Time] [2021-09-13 14:25:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-13 14:25:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-13 14:25:56,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:56,427 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:56,428 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:56,429 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:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,433 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:25:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:25:56,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,435 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:56,437 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:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,442 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:25:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:25:56,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:56,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:56,446 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:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-09-13 14:25:56,450 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2021-09-13 14:25:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:56,451 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-09-13 14:25:56,452 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:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:25:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:25:56,453 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:56,453 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:56,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:25:56,454 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:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1507359540, now seen corresponding path program 1 times [2021-09-13 14:25:56,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:56,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574770154] [2021-09-13 14:25:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:56,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:56,487 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:56,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814651282] [2021-09-13 14:25:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:56,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:56,490 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:56,491 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:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:56,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:25:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:56,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:56,654 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:56,655 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:56,655 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:56,656 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:56,656 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:56,657 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:56,657 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:56,658 INFO L281 TraceCheckUtils]: 7: Hoare triple {281#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {258#false} is VALID [2021-09-13 14:25:56,658 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:56,659 INFO L281 TraceCheckUtils]: 9: Hoare triple {258#false} assume 0 == __VERIFIER_assert_~cond; {258#false} is VALID [2021-09-13 14:25:56,659 INFO L281 TraceCheckUtils]: 10: Hoare triple {258#false} assume !false; {258#false} is VALID [2021-09-13 14:25:56,659 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:56,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:56,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:56,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574770154] [2021-09-13 14:25:56,660 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:56,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814651282] [2021-09-13 14:25:56,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814651282] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:56,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:56,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:25:56,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082249064] [2021-09-13 14:25:56,662 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:56,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:56,662 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:56,673 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:56,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:25:56,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:56,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:25:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:25:56,675 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:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,854 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-09-13 14:25:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:25:56,854 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:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:56,854 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:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-09-13 14:25:56,855 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:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-09-13 14:25:56,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2021-09-13 14:25:56,896 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:56,897 INFO L225 Difference]: With dead ends: 42 [2021-09-13 14:25:56,897 INFO L226 Difference]: Without dead ends: 38 [2021-09-13 14:25:56,897 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.24ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:25:56,898 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.67ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:56,899 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 96.67ms Time] [2021-09-13 14:25:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-09-13 14:25:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-09-13 14:25:56,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:56,906 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:56,906 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:56,906 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:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,908 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 14:25:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:25:56,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,909 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:56,909 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:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,910 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 14:25:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:25:56,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:56,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:56,911 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:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 14:25:56,913 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2021-09-13 14:25:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:56,913 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 14:25:56,913 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:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:25:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:25:56,914 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:56,914 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:56,941 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:57,125 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:57,126 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:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash 515746917, now seen corresponding path program 1 times [2021-09-13 14:25:57,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:57,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022060251] [2021-09-13 14:25:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:57,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:57,138 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:57,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69086523] [2021-09-13 14:25:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:57,139 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:57,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:57,140 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:57,142 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:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:57,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:25:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:57,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:57,382 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:57,382 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:57,383 INFO L281 TraceCheckUtils]: 2: Hoare triple {465#true} assume !(0 == assume_abort_if_not_~cond); {465#true} is VALID [2021-09-13 14:25:57,384 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:57,385 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:57,385 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:57,386 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:57,387 INFO L281 TraceCheckUtils]: 7: Hoare triple {487#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {487#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:57,390 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:57,390 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:57,390 INFO L281 TraceCheckUtils]: 10: Hoare triple {466#false} assume 0 == __VERIFIER_assert_~cond; {466#false} is VALID [2021-09-13 14:25:57,391 INFO L281 TraceCheckUtils]: 11: Hoare triple {466#false} assume !false; {466#false} is VALID [2021-09-13 14:25:57,391 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:57,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:57,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:57,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022060251] [2021-09-13 14:25:57,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:57,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69086523] [2021-09-13 14:25:57,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69086523] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:57,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:57,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:25:57,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766789903] [2021-09-13 14:25:57,393 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:57,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:57,394 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:57,406 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:57,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:25:57,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:25:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:57,408 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:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:57,728 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2021-09-13 14:25:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:25:57,728 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:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:57,729 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:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-09-13 14:25:57,730 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:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-09-13 14:25:57,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2021-09-13 14:25:57,805 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:57,807 INFO L225 Difference]: With dead ends: 66 [2021-09-13 14:25:57,807 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:25:57,807 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.79ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:25:57,808 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.76ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.86ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:57,809 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 3.76ms Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 89.86ms Time] [2021-09-13 14:25:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:25:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 39. [2021-09-13 14:25:57,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:57,826 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:57,826 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:57,827 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:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:57,829 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:25:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-09-13 14:25:57,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:57,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:57,831 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:57,831 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:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:57,835 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:25:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-09-13 14:25:57,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:57,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:57,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:57,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:57,838 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:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-09-13 14:25:57,841 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2021-09-13 14:25:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:57,841 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-09-13 14:25:57,841 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:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:25:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:25:57,843 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:57,843 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:57,871 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:58,056 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:58,057 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:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1270616931, now seen corresponding path program 1 times [2021-09-13 14:25:58,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:58,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301347253] [2021-09-13 14:25:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:58,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:58,070 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:58,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73017354] [2021-09-13 14:25:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:58,071 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:58,072 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:58,086 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:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:58,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:25:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:58,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:58,572 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:58,573 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:58,573 INFO L281 TraceCheckUtils]: 2: Hoare triple {760#true} assume !(0 == assume_abort_if_not_~cond); {760#true} is VALID [2021-09-13 14:25:58,574 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:58,576 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:58,576 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:58,593 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:58,594 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 < 50);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:58,594 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:58,595 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:58,601 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 < 50);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:58,602 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:58,602 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:58,603 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 < 50);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:58,604 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:58,604 INFO L281 TraceCheckUtils]: 15: Hoare triple {761#false} assume !false; {761#false} is VALID [2021-09-13 14:25:58,605 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:58,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:58,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:58,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301347253] [2021-09-13 14:25:58,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:58,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73017354] [2021-09-13 14:25:58,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73017354] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:58,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:58,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:25:58,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834579456] [2021-09-13 14:25:58,611 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:58,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:58,612 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:58,625 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:58,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:25:58,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:25:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:25:58,628 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:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:58,983 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:25:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:25:58,983 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:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:58,983 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:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2021-09-13 14:25:58,985 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:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2021-09-13 14:25:58,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2021-09-13 14:25:59,056 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:59,057 INFO L225 Difference]: With dead ends: 62 [2021-09-13 14:25:59,057 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:25:59,058 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 99.34ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:25:59,058 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.80ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:59,059 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 101.80ms Time] [2021-09-13 14:25:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:25:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2021-09-13 14:25:59,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:59,101 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:59,102 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:59,102 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:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:59,104 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-09-13 14:25:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-09-13 14:25:59,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:59,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:59,105 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:59,105 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:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:59,107 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-09-13 14:25:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-09-13 14:25:59,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:59,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:59,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:59,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:59,109 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:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2021-09-13 14:25:59,110 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2021-09-13 14:25:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:59,111 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2021-09-13 14:25:59,111 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:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2021-09-13 14:25:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:25:59,111 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:59,112 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:59,138 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:59,337 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:59,338 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:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash -648504839, now seen corresponding path program 1 times [2021-09-13 14:25:59,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:59,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108069379] [2021-09-13 14:25:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:59,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:59,350 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:59,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580955931] [2021-09-13 14:25:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:59,352 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:59,353 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:59,354 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:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:59,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:25:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:59,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:59,545 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:59,546 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:59,546 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:59,547 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:59,547 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:59,548 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:59,548 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:59,549 INFO L281 TraceCheckUtils]: 7: Hoare triple {1106#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {1106#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:59,549 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:59,550 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:59,550 INFO L281 TraceCheckUtils]: 10: Hoare triple {1116#(<= |ULTIMATE.start_main_#t~post10| 1)} assume !(main_#t~post10 < 50);havoc main_#t~post10; {1083#false} is VALID [2021-09-13 14:25:59,565 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:59,565 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:59,565 INFO L281 TraceCheckUtils]: 13: Hoare triple {1083#false} assume !(main_#t~post9 < 50);havoc main_#t~post9; {1083#false} is VALID [2021-09-13 14:25:59,565 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:59,566 INFO L281 TraceCheckUtils]: 15: Hoare triple {1083#false} assume 0 == __VERIFIER_assert_~cond; {1083#false} is VALID [2021-09-13 14:25:59,566 INFO L281 TraceCheckUtils]: 16: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2021-09-13 14:25:59,566 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:59,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:59,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:59,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108069379] [2021-09-13 14:25:59,580 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:59,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580955931] [2021-09-13 14:25:59,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580955931] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:59,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:59,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:25:59,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939241273] [2021-09-13 14:25:59,582 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:59,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:59,582 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:59,596 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:59,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:25:59,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:25:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:59,597 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:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:59,788 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2021-09-13 14:25:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:25:59,788 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:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:59,788 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:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-09-13 14:25:59,790 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:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-09-13 14:25:59,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2021-09-13 14:25:59,851 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:59,853 INFO L225 Difference]: With dead ends: 85 [2021-09-13 14:25:59,853 INFO L226 Difference]: Without dead ends: 55 [2021-09-13 14:25:59,853 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.18ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:59,854 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.61ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.85ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:59,854 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.61ms Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 87.85ms Time] [2021-09-13 14:25:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-09-13 14:25:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-09-13 14:25:59,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:59,891 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:59,892 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:59,892 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:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:59,893 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-09-13 14:25:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:25:59,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:59,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:59,894 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:59,894 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:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:59,896 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-09-13 14:25:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:25:59,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:59,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:59,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:59,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:59,897 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:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2021-09-13 14:25:59,898 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 17 [2021-09-13 14:25:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:59,898 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-09-13 14:25:59,898 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:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:25:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:25:59,899 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:59,899 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:59,925 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:26:00,099 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:26:00,100 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:26:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1354097033, now seen corresponding path program 1 times [2021-09-13 14:26:00,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:00,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450911774] [2021-09-13 14:26:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:00,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:00,111 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:00,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808476869] [2021-09-13 14:26:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:00,111 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:00,112 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:26:00,113 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:26:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:00,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:26:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:00,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:00,391 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:26:00,391 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:26:00,392 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:26:00,392 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:26:00,392 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:26:00,393 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:26:00,393 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:26:00,394 INFO L281 TraceCheckUtils]: 7: Hoare triple {1448#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {1448#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:00,394 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:26:00,395 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:26:00,395 INFO L281 TraceCheckUtils]: 10: Hoare triple {1458#(<= ~counter~0 2)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {1458#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:00,401 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:26:00,401 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:26:00,402 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:26:00,402 INFO L281 TraceCheckUtils]: 14: Hoare triple {1471#(<= |ULTIMATE.start_main_#t~post9| 2)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {1425#false} is VALID [2021-09-13 14:26:00,402 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:26:00,402 INFO L281 TraceCheckUtils]: 16: Hoare triple {1425#false} assume 0 == __VERIFIER_assert_~cond; {1425#false} is VALID [2021-09-13 14:26:00,403 INFO L281 TraceCheckUtils]: 17: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2021-09-13 14:26:00,403 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:26:00,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:00,584 INFO L281 TraceCheckUtils]: 17: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2021-09-13 14:26:00,584 INFO L281 TraceCheckUtils]: 16: Hoare triple {1425#false} assume 0 == __VERIFIER_assert_~cond; {1425#false} is VALID [2021-09-13 14:26:00,584 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:26:00,586 INFO L281 TraceCheckUtils]: 14: Hoare triple {1493#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {1425#false} is VALID [2021-09-13 14:26:00,587 INFO L281 TraceCheckUtils]: 13: Hoare triple {1497#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1493#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:26:00,587 INFO L281 TraceCheckUtils]: 12: Hoare triple {1497#(< ~counter~0 50)} 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 50)} is VALID [2021-09-13 14:26:00,587 INFO L281 TraceCheckUtils]: 11: Hoare triple {1497#(< ~counter~0 50)} assume !(main_~c~0 >= main_~b~0); {1497#(< ~counter~0 50)} is VALID [2021-09-13 14:26:00,588 INFO L281 TraceCheckUtils]: 10: Hoare triple {1497#(< ~counter~0 50)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {1497#(< ~counter~0 50)} is VALID [2021-09-13 14:26:00,588 INFO L281 TraceCheckUtils]: 9: Hoare triple {1510#(< ~counter~0 49)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1497#(< ~counter~0 50)} is VALID [2021-09-13 14:26:00,588 INFO L281 TraceCheckUtils]: 8: Hoare triple {1510#(< ~counter~0 49)} 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 49)} is VALID [2021-09-13 14:26:00,589 INFO L281 TraceCheckUtils]: 7: Hoare triple {1510#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {1510#(< ~counter~0 49)} is VALID [2021-09-13 14:26:00,589 INFO L281 TraceCheckUtils]: 6: Hoare triple {1520#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1510#(< ~counter~0 49)} is VALID [2021-09-13 14:26:00,591 INFO L281 TraceCheckUtils]: 5: Hoare triple {1520#(< ~counter~0 48)} 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 48)} is VALID [2021-09-13 14:26:00,591 INFO L281 TraceCheckUtils]: 4: Hoare triple {1520#(< ~counter~0 48)} assume !(0 == assume_abort_if_not_~cond); {1520#(< ~counter~0 48)} is VALID [2021-09-13 14:26:00,592 INFO L281 TraceCheckUtils]: 3: Hoare triple {1520#(< ~counter~0 48)} 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 48)} is VALID [2021-09-13 14:26:00,592 INFO L281 TraceCheckUtils]: 2: Hoare triple {1520#(< ~counter~0 48)} assume !(0 == assume_abort_if_not_~cond); {1520#(< ~counter~0 48)} is VALID [2021-09-13 14:26:00,593 INFO L281 TraceCheckUtils]: 1: Hoare triple {1520#(< ~counter~0 48)} 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 48)} is VALID [2021-09-13 14:26:00,593 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 48)} is VALID [2021-09-13 14:26:00,593 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:26:00,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:00,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450911774] [2021-09-13 14:26:00,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:00,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808476869] [2021-09-13 14:26:00,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808476869] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:00,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:00,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:26:00,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139391628] [2021-09-13 14:26:00,595 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:26:00,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:00,595 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:26:00,618 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:26:00,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:26:00,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:26:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:26:00,619 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:26:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:01,239 INFO L93 Difference]: Finished difference Result 156 states and 188 transitions. [2021-09-13 14:26:01,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:26:01,239 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:26:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:01,240 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:26:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2021-09-13 14:26:01,242 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:26:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2021-09-13 14:26:01,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 144 transitions. [2021-09-13 14:26:01,349 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:26:01,352 INFO L225 Difference]: With dead ends: 156 [2021-09-13 14:26:01,352 INFO L226 Difference]: Without dead ends: 152 [2021-09-13 14:26:01,353 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 68.10ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:26:01,353 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 228.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.88ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 231.04ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:01,354 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 2.88ms Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 231.04ms Time] [2021-09-13 14:26:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-09-13 14:26:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2021-09-13 14:26:01,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:01,446 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:26:01,447 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:26:01,447 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:26:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:01,451 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-09-13 14:26:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-09-13 14:26:01,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:01,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:01,452 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:26:01,452 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:26:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:01,457 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-09-13 14:26:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-09-13 14:26:01,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:01,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:01,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:01,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:01,458 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:26:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2021-09-13 14:26:01,461 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 18 [2021-09-13 14:26:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:01,461 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2021-09-13 14:26:01,461 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:26:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2021-09-13 14:26:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:26:01,462 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:01,462 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:26:01,488 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:26:01,684 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:26:01,684 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:26:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1292001664, now seen corresponding path program 1 times [2021-09-13 14:26:01,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:01,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360937767] [2021-09-13 14:26:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:01,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:01,696 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:01,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49275057] [2021-09-13 14:26:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:01,697 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:01,698 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:26:01,707 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:26:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:01,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-09-13 14:26:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:01,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:02,343 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:26:02,343 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:26:02,344 INFO L281 TraceCheckUtils]: 2: Hoare triple {2168#true} assume !(0 == assume_abort_if_not_~cond); {2168#true} is VALID [2021-09-13 14:26:02,344 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:26:02,345 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:26:02,347 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:26:02,348 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:26:02,348 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 < 50);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:26:02,348 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:26:02,350 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:26:02,350 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 < 50);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:26:02,351 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:26:02,351 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:26:02,353 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 < 50);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:26:02,353 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:26:02,354 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:26:02,355 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:26:02,355 INFO L281 TraceCheckUtils]: 17: Hoare triple {2169#false} assume !false; {2169#false} is VALID [2021-09-13 14:26:02,355 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:26:02,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:02,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:02,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360937767] [2021-09-13 14:26:02,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:02,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49275057] [2021-09-13 14:26:02,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49275057] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:02,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:02,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:26:02,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354206193] [2021-09-13 14:26:02,357 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:26:02,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:02,357 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:26:02,383 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:26:02,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:26:02,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:26:02,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:26:02,384 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:26:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:03,249 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2021-09-13 14:26:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:26:03,249 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:26:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:03,249 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:26:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2021-09-13 14:26:03,251 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:26:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2021-09-13 14:26:03,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2021-09-13 14:26:03,338 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:26:03,340 INFO L225 Difference]: With dead ends: 115 [2021-09-13 14:26:03,340 INFO L226 Difference]: Without dead ends: 113 [2021-09-13 14:26:03,340 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 300.52ms TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:26:03,341 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 191.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.29ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 193.55ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:03,341 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 2.29ms Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 193.55ms Time] [2021-09-13 14:26:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-09-13 14:26:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2021-09-13 14:26:03,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:03,490 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:26:03,490 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:26:03,491 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:26:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:03,493 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2021-09-13 14:26:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-09-13 14:26:03,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:03,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:03,494 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:26:03,494 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:26:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:03,497 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2021-09-13 14:26:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-09-13 14:26:03,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:03,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:03,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:03,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:03,498 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:26:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2021-09-13 14:26:03,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 18 [2021-09-13 14:26:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:03,504 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2021-09-13 14:26:03,504 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:26:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2021-09-13 14:26:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:26:03,505 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:03,505 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:26:03,532 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:26:03,729 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:26:03,729 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:26:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 971917338, now seen corresponding path program 1 times [2021-09-13 14:26:03,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:03,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263452129] [2021-09-13 14:26:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:03,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:03,737 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:03,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176866542] [2021-09-13 14:26:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:03,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:03,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:03,739 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:26:03,743 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:26:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:03,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:26:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:03,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:03,997 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:26:03,998 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:26:03,999 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:26:03,999 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:26:04,000 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:26:04,000 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:26:04,001 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:26:04,001 INFO L281 TraceCheckUtils]: 7: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:26:04,001 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:26:04,002 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:26:04,002 INFO L281 TraceCheckUtils]: 10: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:26:04,003 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:26:04,003 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:26:04,004 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:26:04,004 INFO L281 TraceCheckUtils]: 14: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:04,004 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:26:04,005 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:26:04,005 INFO L281 TraceCheckUtils]: 17: Hoare triple {2738#false} assume 0 == __VERIFIER_assert_~cond; {2738#false} is VALID [2021-09-13 14:26:04,005 INFO L281 TraceCheckUtils]: 18: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2021-09-13 14:26:04,005 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:26:04,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:04,175 INFO L281 TraceCheckUtils]: 18: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2021-09-13 14:26:04,176 INFO L281 TraceCheckUtils]: 17: Hoare triple {2738#false} assume 0 == __VERIFIER_assert_~cond; {2738#false} is VALID [2021-09-13 14:26:04,176 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:26:04,176 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:26:04,177 INFO L281 TraceCheckUtils]: 14: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:04,177 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:26:04,177 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:26:04,178 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:26:04,178 INFO L281 TraceCheckUtils]: 10: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:26:04,179 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:26:04,179 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:26:04,179 INFO L281 TraceCheckUtils]: 7: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:26:04,180 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:26:04,180 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:26:04,180 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:26:04,181 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:26:04,181 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:26:04,182 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:26:04,182 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:26:04,182 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:26:04,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:04,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263452129] [2021-09-13 14:26:04,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:04,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176866542] [2021-09-13 14:26:04,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176866542] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:04,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:04,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:26:04,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797492256] [2021-09-13 14:26:04,184 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:26:04,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:04,184 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:26:04,199 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:26:04,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:26:04,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:26:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:26:04,201 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:26:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:05,129 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2021-09-13 14:26:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:26:05,129 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:26:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:05,129 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:26:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2021-09-13 14:26:05,131 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:26:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2021-09-13 14:26:05,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2021-09-13 14:26:05,258 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:26:05,262 INFO L225 Difference]: With dead ends: 225 [2021-09-13 14:26:05,262 INFO L226 Difference]: Without dead ends: 221 [2021-09-13 14:26:05,263 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 111.50ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:26:05,263 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 263.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.98ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 266.53ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:05,263 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 4.98ms Time], IncrementalHoareTripleChecker [18 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 266.53ms Time] [2021-09-13 14:26:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-09-13 14:26:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2021-09-13 14:26:05,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:05,474 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:26:05,474 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:26:05,474 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:26:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:05,479 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2021-09-13 14:26:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-09-13 14:26:05,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:05,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:05,480 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:26:05,480 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:26:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:05,485 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2021-09-13 14:26:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-09-13 14:26:05,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:05,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:05,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:05,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:05,486 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:26:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2021-09-13 14:26:05,489 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 19 [2021-09-13 14:26:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:05,489 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2021-09-13 14:26:05,490 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:26:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2021-09-13 14:26:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:26:05,490 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:05,490 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:26:05,518 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:26:05,711 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:26:05,711 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:26:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash -367893245, now seen corresponding path program 1 times [2021-09-13 14:26:05,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:05,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767277768] [2021-09-13 14:26:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:05,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:05,722 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:05,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812818795] [2021-09-13 14:26:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:05,723 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:05,724 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:26:05,730 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:26:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:05,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:26:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:05,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:06,092 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:26:06,092 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:26:06,093 INFO L281 TraceCheckUtils]: 2: Hoare triple {3765#true} assume !(0 == assume_abort_if_not_~cond); {3765#true} is VALID [2021-09-13 14:26:06,093 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:26:06,094 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:26:06,094 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:26:06,094 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:26:06,095 INFO L281 TraceCheckUtils]: 7: Hoare triple {3787#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {3787#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:06,095 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:26:06,096 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:26:06,096 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 < 50);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:26:06,097 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:26:06,097 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:26:06,098 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 < 50);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:26:06,098 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:26:06,099 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:26:06,099 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:26:06,099 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:26:06,100 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:26:06,100 INFO L281 TraceCheckUtils]: 19: Hoare triple {3766#false} assume !false; {3766#false} is VALID [2021-09-13 14:26:06,100 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:26:06,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:06,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:06,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767277768] [2021-09-13 14:26:06,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:06,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812818795] [2021-09-13 14:26:06,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812818795] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:06,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:06,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:26:06,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466572865] [2021-09-13 14:26:06,101 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:26:06,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:06,101 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:26:06,115 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:26:06,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:26:06,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:26:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:26:06,116 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:26:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:06,708 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2021-09-13 14:26:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:26:06,708 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:26:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:06,709 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:26:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2021-09-13 14:26:06,710 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:26:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2021-09-13 14:26:06,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2021-09-13 14:26:06,786 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:26:06,787 INFO L225 Difference]: With dead ends: 145 [2021-09-13 14:26:06,787 INFO L226 Difference]: Without dead ends: 143 [2021-09-13 14:26:06,788 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 124.33ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:26:06,788 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.54ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.44ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:06,788 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 2.54ms Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 117.44ms Time] [2021-09-13 14:26:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-09-13 14:26:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2021-09-13 14:26:07,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:07,040 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:26:07,041 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:26:07,041 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:26:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:07,051 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-09-13 14:26:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-09-13 14:26:07,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:07,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:07,058 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:26:07,060 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:26:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:07,064 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-09-13 14:26:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-09-13 14:26:07,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:07,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:07,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:07,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:07,065 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:26:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2021-09-13 14:26:07,068 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 20 [2021-09-13 14:26:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:07,068 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2021-09-13 14:26:07,068 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:26:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2021-09-13 14:26:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:26:07,069 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:07,069 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:26:07,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:26:07,289 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:26:07,290 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:26:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1357932506, now seen corresponding path program 1 times [2021-09-13 14:26:07,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:07,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636616406] [2021-09-13 14:26:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:07,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:07,301 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:07,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470983699] [2021-09-13 14:26:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:07,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:07,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:07,303 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:26:07,306 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:26:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:07,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:26:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:07,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:07,556 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:26:07,556 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:26:07,556 INFO L281 TraceCheckUtils]: 2: Hoare triple {4497#true} assume !(0 == assume_abort_if_not_~cond); {4497#true} is VALID [2021-09-13 14:26:07,557 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:26:07,557 INFO L281 TraceCheckUtils]: 4: Hoare triple {4497#true} assume !(0 == assume_abort_if_not_~cond); {4497#true} is VALID [2021-09-13 14:26:07,557 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:26:07,557 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:26:07,557 INFO L281 TraceCheckUtils]: 7: Hoare triple {4497#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {4497#true} is VALID [2021-09-13 14:26:07,557 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:26:07,558 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:26:07,558 INFO L281 TraceCheckUtils]: 10: Hoare triple {4497#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {4497#true} is VALID [2021-09-13 14:26:07,558 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:26:07,559 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:26:07,559 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 < 50);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:26:07,560 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:26:07,560 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:26:07,561 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:26:07,561 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:26:07,562 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:26:07,562 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:26:07,562 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:26:07,563 INFO L281 TraceCheckUtils]: 21: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2021-09-13 14:26:07,564 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:26:07,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:07,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:07,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636616406] [2021-09-13 14:26:07,564 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:07,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470983699] [2021-09-13 14:26:07,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470983699] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:07,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:07,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:26:07,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921916271] [2021-09-13 14:26:07,565 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:26:07,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:07,566 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:26:07,581 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:26:07,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:26:07,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:26:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:26:07,582 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:26:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:08,192 INFO L93 Difference]: Finished difference Result 265 states and 358 transitions. [2021-09-13 14:26:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:26:08,192 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:26:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:08,193 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:26:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-09-13 14:26:08,193 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:26:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-09-13 14:26:08,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2021-09-13 14:26:08,254 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:26:08,259 INFO L225 Difference]: With dead ends: 265 [2021-09-13 14:26:08,259 INFO L226 Difference]: Without dead ends: 263 [2021-09-13 14:26:08,260 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:26:08,260 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 127.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.07ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.79ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:08,261 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 1.07ms Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 128.79ms Time] [2021-09-13 14:26:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-09-13 14:26:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 162. [2021-09-13 14:26:08,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:08,573 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:26:08,573 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:26:08,573 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:26:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:08,577 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2021-09-13 14:26:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2021-09-13 14:26:08,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:08,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:08,578 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:26:08,579 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:26:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:08,584 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2021-09-13 14:26:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2021-09-13 14:26:08,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:08,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:08,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:08,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:08,586 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:26:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2021-09-13 14:26:08,588 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 22 [2021-09-13 14:26:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:08,589 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2021-09-13 14:26:08,589 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:26:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2021-09-13 14:26:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:26:08,589 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:08,590 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:26:08,608 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:26:08,797 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:26:08,797 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:26:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1235592658, now seen corresponding path program 1 times [2021-09-13 14:26:08,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:08,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884026793] [2021-09-13 14:26:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:08,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:08,807 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:08,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491972718] [2021-09-13 14:26:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:08,808 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:08,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:08,809 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:26:08,841 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:26:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:08,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2021-09-13 14:26:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:08,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:09,314 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:26:09,315 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:26:09,315 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:26:09,316 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:26:09,316 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:26:09,317 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:26:09,318 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:26:09,318 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 < 50);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:26:09,319 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:26:09,319 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:26:09,320 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 < 50);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:26:09,320 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:26:09,321 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:26:09,321 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:26:09,322 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 < 50);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:26:09,322 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:26:09,323 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:26:09,323 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 < 50);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:26:09,324 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:26:09,324 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:26:09,325 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 < 50);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:26:09,325 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:26:09,326 INFO L281 TraceCheckUtils]: 22: Hoare triple {5667#false} assume !false; {5667#false} is VALID [2021-09-13 14:26:09,326 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:09,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:09,557 INFO L281 TraceCheckUtils]: 22: Hoare triple {5667#false} assume !false; {5667#false} is VALID [2021-09-13 14:26:09,557 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:26:09,558 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 < 50);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:26:09,558 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:26:09,560 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:26:09,560 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 < 50);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:26:09,561 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:26:09,561 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:26:09,562 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 < 50);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:26:09,562 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:26:09,563 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:26:09,563 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:26:09,563 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 < 50);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:26:09,564 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:26:09,564 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:26:09,565 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 < 50);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:26:09,565 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:26:09,566 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:26:09,566 INFO L281 TraceCheckUtils]: 4: Hoare triple {5666#true} assume !(0 == assume_abort_if_not_~cond); {5666#true} is VALID [2021-09-13 14:26:09,566 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:26:09,566 INFO L281 TraceCheckUtils]: 2: Hoare triple {5666#true} assume !(0 == assume_abort_if_not_~cond); {5666#true} is VALID [2021-09-13 14:26:09,567 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:26:09,567 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:26:09,567 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:09,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:09,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884026793] [2021-09-13 14:26:09,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:09,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491972718] [2021-09-13 14:26:09,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491972718] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:09,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:09,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2021-09-13 14:26:09,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653703614] [2021-09-13 14:26:09,569 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:26:09,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:09,569 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:26:09,605 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:26:09,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:26:09,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:26:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:26:09,606 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:26:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:10,593 INFO L93 Difference]: Finished difference Result 230 states and 299 transitions. [2021-09-13 14:26:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:26:10,593 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:26:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:10,593 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:26:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2021-09-13 14:26:10,594 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:26:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2021-09-13 14:26:10,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 102 transitions. [2021-09-13 14:26:10,686 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:26:10,689 INFO L225 Difference]: With dead ends: 230 [2021-09-13 14:26:10,689 INFO L226 Difference]: Without dead ends: 228 [2021-09-13 14:26:10,690 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 114.51ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:26:10,690 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 271.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.60ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 274.57ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:10,691 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 374 Unknown, 0 Unchecked, 2.60ms Time], IncrementalHoareTripleChecker [9 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 274.57ms Time] [2021-09-13 14:26:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-09-13 14:26:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2021-09-13 14:26:11,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:11,073 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:26:11,073 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:26:11,074 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:26:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:11,078 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2021-09-13 14:26:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-09-13 14:26:11,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:11,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:11,079 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:26:11,080 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:26:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:11,084 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2021-09-13 14:26:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-09-13 14:26:11,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:11,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:11,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:11,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:11,086 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:26:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2021-09-13 14:26:11,090 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 23 [2021-09-13 14:26:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:11,090 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2021-09-13 14:26:11,091 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:26:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2021-09-13 14:26:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 14:26:11,091 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:11,092 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:26:11,111 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:26:11,304 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:26:11,305 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:26:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash 8471960, now seen corresponding path program 1 times [2021-09-13 14:26:11,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:11,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957561559] [2021-09-13 14:26:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:11,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:11,342 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:11,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356154686] [2021-09-13 14:26:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:11,344 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:11,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:11,344 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:26:11,346 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:26:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:11,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:26:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:11,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:11,546 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:26:11,547 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:26:11,549 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:26:11,549 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:26:11,549 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:26:11,550 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:26:11,551 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:26:11,552 INFO L281 TraceCheckUtils]: 7: Hoare triple {6897#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {6897#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:11,552 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:26:11,557 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:26:11,559 INFO L281 TraceCheckUtils]: 10: Hoare triple {6907#(<= ~counter~0 2)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {6907#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:11,559 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:26:11,559 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:26:11,560 INFO L281 TraceCheckUtils]: 13: Hoare triple {6917#(<= |ULTIMATE.start_main_#t~post11| 2)} assume !(main_#t~post11 < 50);havoc main_#t~post11; {6874#false} is VALID [2021-09-13 14:26:11,560 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:26:11,560 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:26:11,560 INFO L281 TraceCheckUtils]: 16: Hoare triple {6874#false} assume !(main_#t~post10 < 50);havoc main_#t~post10; {6874#false} is VALID [2021-09-13 14:26:11,560 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:26:11,560 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:26:11,561 INFO L281 TraceCheckUtils]: 19: Hoare triple {6874#false} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {6874#false} is VALID [2021-09-13 14:26:11,561 INFO L281 TraceCheckUtils]: 20: Hoare triple {6874#false} assume !(0 != main_~b~0); {6874#false} is VALID [2021-09-13 14:26:11,561 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:26:11,561 INFO L281 TraceCheckUtils]: 22: Hoare triple {6874#false} assume 0 == __VERIFIER_assert_~cond; {6874#false} is VALID [2021-09-13 14:26:11,561 INFO L281 TraceCheckUtils]: 23: Hoare triple {6874#false} assume !false; {6874#false} is VALID [2021-09-13 14:26:11,561 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:26:11,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:11,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:11,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957561559] [2021-09-13 14:26:11,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:11,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356154686] [2021-09-13 14:26:11,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356154686] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:11,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:11,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:26:11,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080984024] [2021-09-13 14:26:11,563 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:26:11,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:11,563 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:26:11,581 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:26:11,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:26:11,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:26:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:26:11,582 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:26:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:12,150 INFO L93 Difference]: Finished difference Result 308 states and 411 transitions. [2021-09-13 14:26:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:26:12,150 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:26:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:12,150 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:26:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2021-09-13 14:26:12,151 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:26:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2021-09-13 14:26:12,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2021-09-13 14:26:12,218 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:26:12,221 INFO L225 Difference]: With dead ends: 308 [2021-09-13 14:26:12,221 INFO L226 Difference]: Without dead ends: 212 [2021-09-13 14:26:12,222 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 12.33ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:26:12,222 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.72ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.68ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:12,223 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.72ms Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 74.68ms Time] [2021-09-13 14:26:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-09-13 14:26:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-09-13 14:26:12,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:12,654 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:26:12,654 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:26:12,655 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:26:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:12,659 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2021-09-13 14:26:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:26:12,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:12,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:12,660 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:26:12,660 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:26:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:12,664 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2021-09-13 14:26:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:26:12,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:12,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:12,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:12,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:12,666 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:26:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2021-09-13 14:26:12,670 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 24 [2021-09-13 14:26:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:12,670 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2021-09-13 14:26:12,670 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:26:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:26:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-13 14:26:12,671 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:12,671 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:26:12,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-09-13 14:26:12,884 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:26:12,885 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:26:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1993727605, now seen corresponding path program 1 times [2021-09-13 14:26:12,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:12,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791539531] [2021-09-13 14:26:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:12,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:12,895 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:12,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367525224] [2021-09-13 14:26:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:12,896 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:12,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:12,899 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:26:12,905 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:26:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:12,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2021-09-13 14:26:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:12,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:13,490 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:26:13,491 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:26:13,491 INFO L281 TraceCheckUtils]: 2: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:26:13,491 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:26:13,491 INFO L281 TraceCheckUtils]: 4: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:26:13,492 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:26:13,493 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:26:13,494 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 < 50);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:26:13,494 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:26:13,495 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:26:13,496 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 < 50);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:26:13,497 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:26:13,498 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:26:13,498 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:26:13,499 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 < 50);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:26:13,499 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:26:13,500 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:26:13,500 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 < 50);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:26:13,501 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:26:13,501 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:26:13,502 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 < 50);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:26:13,502 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:26:13,503 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:26:13,503 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:26:13,503 INFO L281 TraceCheckUtils]: 24: Hoare triple {8087#false} assume !false; {8087#false} is VALID [2021-09-13 14:26:13,505 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:13,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:13,770 INFO L281 TraceCheckUtils]: 24: Hoare triple {8087#false} assume !false; {8087#false} is VALID [2021-09-13 14:26:13,771 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:26:13,772 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:26:13,772 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:26:13,772 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 < 50);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:26:13,773 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:26:13,773 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:26:13,774 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 < 50);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:26:13,774 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:26:13,774 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:26:13,775 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 < 50);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:26:13,775 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:26:14,208 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:26:14,210 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:26:14,210 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 < 50);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:26:14,211 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:26:14,211 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:26:14,212 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 < 50);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:26:14,212 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:26:14,212 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:26:14,212 INFO L281 TraceCheckUtils]: 4: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:26:14,212 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:26:14,212 INFO L281 TraceCheckUtils]: 2: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:26:14,213 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:26:14,213 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:26:14,213 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:14,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:14,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791539531] [2021-09-13 14:26:14,213 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:14,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367525224] [2021-09-13 14:26:14,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367525224] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:14,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:14,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:26:14,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126558281] [2021-09-13 14:26:14,214 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:26:14,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:14,214 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:26:14,384 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:26:14,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:26:14,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:26:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:26:14,385 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:26:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:17,052 INFO L93 Difference]: Finished difference Result 532 states and 707 transitions. [2021-09-13 14:26:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:26:17,052 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:26:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:17,052 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:26:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 290 transitions. [2021-09-13 14:26:17,055 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:26:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 290 transitions. [2021-09-13 14:26:17,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 290 transitions. [2021-09-13 14:26:17,653 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:26:17,669 INFO L225 Difference]: With dead ends: 532 [2021-09-13 14:26:17,669 INFO L226 Difference]: Without dead ends: 526 [2021-09-13 14:26:17,670 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 355.42ms TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:26:17,670 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 625.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.59ms SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 629.38ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:17,671 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 5.59ms Time], IncrementalHoareTripleChecker [87 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 629.38ms Time] [2021-09-13 14:26:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-09-13 14:26:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 339. [2021-09-13 14:26:18,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:18,320 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:26:18,321 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:26:18,322 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:26:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:18,336 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-09-13 14:26:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 676 transitions. [2021-09-13 14:26:18,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:18,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:18,338 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:26:18,339 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:26:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:18,353 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-09-13 14:26:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 676 transitions. [2021-09-13 14:26:18,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:18,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:18,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:18,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:18,356 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:26:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 460 transitions. [2021-09-13 14:26:18,364 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 460 transitions. Word has length 25 [2021-09-13 14:26:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:18,364 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 460 transitions. [2021-09-13 14:26:18,365 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:26:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 460 transitions. [2021-09-13 14:26:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-13 14:26:18,365 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:18,366 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:26:18,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-09-13 14:26:18,584 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:26:18,584 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:26:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1504234129, now seen corresponding path program 1 times [2021-09-13 14:26:18,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:18,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82818794] [2021-09-13 14:26:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:18,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:18,590 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:18,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303331223] [2021-09-13 14:26:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:18,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:18,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:18,595 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:26:18,596 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:26:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:18,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:26:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:18,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:18,870 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:26:18,871 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:26:18,871 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:26:18,871 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:26:18,872 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:26:18,872 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:26:18,877 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:26:18,877 INFO L281 TraceCheckUtils]: 7: Hoare triple {10536#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {10536#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:18,877 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:26:18,878 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:26:18,878 INFO L281 TraceCheckUtils]: 10: Hoare triple {10546#(<= ~counter~0 2)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {10546#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:18,878 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:26:18,879 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:26:18,880 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:26:18,880 INFO L281 TraceCheckUtils]: 14: Hoare triple {10559#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {10559#(<= ~counter~0 3)} is VALID [2021-09-13 14:26:18,880 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:26:18,880 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:26:18,881 INFO L281 TraceCheckUtils]: 17: Hoare triple {10569#(<= |ULTIMATE.start_main_#t~post10| 3)} assume !(main_#t~post10 < 50);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:26:18,881 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:26:18,881 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:26:18,881 INFO L281 TraceCheckUtils]: 20: Hoare triple {10513#false} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:26:18,881 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:26:18,881 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:26:18,881 INFO L281 TraceCheckUtils]: 23: Hoare triple {10513#false} assume !(main_#t~post10 < 50);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:26:18,881 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:26:18,881 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:26:18,881 INFO L281 TraceCheckUtils]: 26: Hoare triple {10513#false} assume !(main_#t~post9 < 50);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:26:18,882 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:26:18,882 INFO L281 TraceCheckUtils]: 28: Hoare triple {10513#false} assume 0 == __VERIFIER_assert_~cond; {10513#false} is VALID [2021-09-13 14:26:18,882 INFO L281 TraceCheckUtils]: 29: Hoare triple {10513#false} assume !false; {10513#false} is VALID [2021-09-13 14:26:18,882 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:26:18,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:19,108 INFO L281 TraceCheckUtils]: 29: Hoare triple {10513#false} assume !false; {10513#false} is VALID [2021-09-13 14:26:19,108 INFO L281 TraceCheckUtils]: 28: Hoare triple {10513#false} assume 0 == __VERIFIER_assert_~cond; {10513#false} is VALID [2021-09-13 14:26:19,108 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:26:19,109 INFO L281 TraceCheckUtils]: 26: Hoare triple {10513#false} assume !(main_#t~post9 < 50);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:26:19,109 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:26:19,109 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:26:19,109 INFO L281 TraceCheckUtils]: 23: Hoare triple {10513#false} assume !(main_#t~post10 < 50);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:26:19,109 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:26:19,109 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:26:19,109 INFO L281 TraceCheckUtils]: 20: Hoare triple {10513#false} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:26:19,110 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:26:19,110 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:26:19,110 INFO L281 TraceCheckUtils]: 17: Hoare triple {10645#(< |ULTIMATE.start_main_#t~post10| 50)} assume !(main_#t~post10 < 50);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:26:19,111 INFO L281 TraceCheckUtils]: 16: Hoare triple {10649#(< ~counter~0 50)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10645#(< |ULTIMATE.start_main_#t~post10| 50)} is VALID [2021-09-13 14:26:19,111 INFO L281 TraceCheckUtils]: 15: Hoare triple {10649#(< ~counter~0 50)} 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 50)} is VALID [2021-09-13 14:26:19,111 INFO L281 TraceCheckUtils]: 14: Hoare triple {10649#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {10649#(< ~counter~0 50)} is VALID [2021-09-13 14:26:19,112 INFO L281 TraceCheckUtils]: 13: Hoare triple {10659#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10649#(< ~counter~0 50)} is VALID [2021-09-13 14:26:19,113 INFO L281 TraceCheckUtils]: 12: Hoare triple {10659#(< ~counter~0 49)} 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 49)} is VALID [2021-09-13 14:26:19,113 INFO L281 TraceCheckUtils]: 11: Hoare triple {10659#(< ~counter~0 49)} assume !(main_~c~0 >= main_~b~0); {10659#(< ~counter~0 49)} is VALID [2021-09-13 14:26:19,113 INFO L281 TraceCheckUtils]: 10: Hoare triple {10659#(< ~counter~0 49)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {10659#(< ~counter~0 49)} is VALID [2021-09-13 14:26:19,114 INFO L281 TraceCheckUtils]: 9: Hoare triple {10672#(< ~counter~0 48)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10659#(< ~counter~0 49)} is VALID [2021-09-13 14:26:19,114 INFO L281 TraceCheckUtils]: 8: Hoare triple {10672#(< ~counter~0 48)} 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 48)} is VALID [2021-09-13 14:26:19,115 INFO L281 TraceCheckUtils]: 7: Hoare triple {10672#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {10672#(< ~counter~0 48)} is VALID [2021-09-13 14:26:19,116 INFO L281 TraceCheckUtils]: 6: Hoare triple {10682#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10672#(< ~counter~0 48)} is VALID [2021-09-13 14:26:19,117 INFO L281 TraceCheckUtils]: 5: Hoare triple {10682#(< ~counter~0 47)} 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 47)} is VALID [2021-09-13 14:26:19,121 INFO L281 TraceCheckUtils]: 4: Hoare triple {10682#(< ~counter~0 47)} assume !(0 == assume_abort_if_not_~cond); {10682#(< ~counter~0 47)} is VALID [2021-09-13 14:26:19,122 INFO L281 TraceCheckUtils]: 3: Hoare triple {10682#(< ~counter~0 47)} 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 47)} is VALID [2021-09-13 14:26:19,122 INFO L281 TraceCheckUtils]: 2: Hoare triple {10682#(< ~counter~0 47)} assume !(0 == assume_abort_if_not_~cond); {10682#(< ~counter~0 47)} is VALID [2021-09-13 14:26:19,122 INFO L281 TraceCheckUtils]: 1: Hoare triple {10682#(< ~counter~0 47)} 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 47)} is VALID [2021-09-13 14:26:19,123 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 47)} is VALID [2021-09-13 14:26:19,124 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:26:19,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:19,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82818794] [2021-09-13 14:26:19,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:19,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303331223] [2021-09-13 14:26:19,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303331223] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:19,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:19,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-09-13 14:26:19,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400132618] [2021-09-13 14:26:19,125 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:26:19,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:19,126 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:26:19,162 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:26:19,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:26:19,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:26:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:26:19,163 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:26:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:21,268 INFO L93 Difference]: Finished difference Result 849 states and 1132 transitions. [2021-09-13 14:26:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-13 14:26:21,268 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:26:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:21,268 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:26:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2021-09-13 14:26:21,270 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:26:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2021-09-13 14:26:21,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 218 transitions. [2021-09-13 14:26:21,435 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:26:21,455 INFO L225 Difference]: With dead ends: 849 [2021-09-13 14:26:21,456 INFO L226 Difference]: Without dead ends: 586 [2021-09-13 14:26:21,459 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 84.33ms TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:26:21,460 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 242.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 244.56ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:21,461 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 388 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 244.56ms Time] [2021-09-13 14:26:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-09-13 14:26:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 532. [2021-09-13 14:26:22,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:22,842 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:26:22,843 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:26:22,844 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:26:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:22,861 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2021-09-13 14:26:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 751 transitions. [2021-09-13 14:26:22,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:22,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:22,863 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:26:22,863 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:26:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:22,881 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2021-09-13 14:26:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 751 transitions. [2021-09-13 14:26:22,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:22,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:22,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:22,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:22,884 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:26:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 704 transitions. [2021-09-13 14:26:22,906 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 704 transitions. Word has length 30 [2021-09-13 14:26:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:22,907 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 704 transitions. [2021-09-13 14:26:22,907 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:26:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 704 transitions. [2021-09-13 14:26:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:26:22,908 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:22,908 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:26:22,934 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:26:23,120 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:26:23,121 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:26:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 685759340, now seen corresponding path program 1 times [2021-09-13 14:26:23,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:23,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801956549] [2021-09-13 14:26:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:23,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:23,128 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:23,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145738022] [2021-09-13 14:26:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:23,129 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:23,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:23,130 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:26:23,134 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:26:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:23,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:26:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:23,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:23,404 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:26:23,405 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:26:23,405 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:26:23,405 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:26:23,406 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:26:23,411 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:26:23,412 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:26:23,413 INFO L281 TraceCheckUtils]: 7: Hoare triple {13826#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {13826#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:23,413 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:26:23,413 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:26:23,414 INFO L281 TraceCheckUtils]: 10: Hoare triple {13836#(<= ~counter~0 2)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {13836#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:23,414 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:26:23,414 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:26:23,415 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:26:23,415 INFO L281 TraceCheckUtils]: 14: Hoare triple {13849#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {13849#(<= ~counter~0 3)} is VALID [2021-09-13 14:26:23,415 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:26:23,416 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:26:23,416 INFO L281 TraceCheckUtils]: 17: Hoare triple {13859#(<= ~counter~0 4)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {13859#(<= ~counter~0 4)} is VALID [2021-09-13 14:26:23,416 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:26:23,417 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:26:23,417 INFO L281 TraceCheckUtils]: 20: Hoare triple {13869#(<= |ULTIMATE.start_main_#t~post11| 4)} assume !(main_#t~post11 < 50);havoc main_#t~post11; {13803#false} is VALID [2021-09-13 14:26:23,417 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:26:23,417 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:26:23,417 INFO L281 TraceCheckUtils]: 23: Hoare triple {13803#false} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {13803#false} is VALID [2021-09-13 14:26:23,417 INFO L281 TraceCheckUtils]: 24: Hoare triple {13803#false} assume !(main_~c~0 >= main_~b~0); {13803#false} is VALID [2021-09-13 14:26:23,417 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:26:23,418 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:26:23,418 INFO L281 TraceCheckUtils]: 27: Hoare triple {13803#false} assume !(main_#t~post9 < 50);havoc main_#t~post9; {13803#false} is VALID [2021-09-13 14:26:23,418 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:26:23,418 INFO L281 TraceCheckUtils]: 29: Hoare triple {13803#false} assume 0 == __VERIFIER_assert_~cond; {13803#false} is VALID [2021-09-13 14:26:23,418 INFO L281 TraceCheckUtils]: 30: Hoare triple {13803#false} assume !false; {13803#false} is VALID [2021-09-13 14:26:23,418 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:26:23,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:23,651 INFO L281 TraceCheckUtils]: 30: Hoare triple {13803#false} assume !false; {13803#false} is VALID [2021-09-13 14:26:23,652 INFO L281 TraceCheckUtils]: 29: Hoare triple {13803#false} assume 0 == __VERIFIER_assert_~cond; {13803#false} is VALID [2021-09-13 14:26:23,652 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:26:23,652 INFO L281 TraceCheckUtils]: 27: Hoare triple {13803#false} assume !(main_#t~post9 < 50);havoc main_#t~post9; {13803#false} is VALID [2021-09-13 14:26:23,652 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:26:23,652 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:26:23,652 INFO L281 TraceCheckUtils]: 24: Hoare triple {13803#false} assume !(main_~c~0 >= main_~b~0); {13803#false} is VALID [2021-09-13 14:26:23,652 INFO L281 TraceCheckUtils]: 23: Hoare triple {13803#false} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {13803#false} is VALID [2021-09-13 14:26:23,652 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:26:23,652 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:26:23,652 INFO L281 TraceCheckUtils]: 20: Hoare triple {13933#(< |ULTIMATE.start_main_#t~post11| 50)} assume !(main_#t~post11 < 50);havoc main_#t~post11; {13803#false} is VALID [2021-09-13 14:26:23,653 INFO L281 TraceCheckUtils]: 19: Hoare triple {13937#(< ~counter~0 50)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {13933#(< |ULTIMATE.start_main_#t~post11| 50)} is VALID [2021-09-13 14:26:23,653 INFO L281 TraceCheckUtils]: 18: Hoare triple {13937#(< ~counter~0 50)} 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 50)} is VALID [2021-09-13 14:26:23,653 INFO L281 TraceCheckUtils]: 17: Hoare triple {13937#(< ~counter~0 50)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {13937#(< ~counter~0 50)} is VALID [2021-09-13 14:26:23,654 INFO L281 TraceCheckUtils]: 16: Hoare triple {13947#(< ~counter~0 49)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13937#(< ~counter~0 50)} is VALID [2021-09-13 14:26:23,654 INFO L281 TraceCheckUtils]: 15: Hoare triple {13947#(< ~counter~0 49)} 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 49)} is VALID [2021-09-13 14:26:23,655 INFO L281 TraceCheckUtils]: 14: Hoare triple {13947#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {13947#(< ~counter~0 49)} is VALID [2021-09-13 14:26:23,655 INFO L281 TraceCheckUtils]: 13: Hoare triple {13957#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13947#(< ~counter~0 49)} is VALID [2021-09-13 14:26:23,655 INFO L281 TraceCheckUtils]: 12: Hoare triple {13957#(< ~counter~0 48)} 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 48)} is VALID [2021-09-13 14:26:23,656 INFO L281 TraceCheckUtils]: 11: Hoare triple {13957#(< ~counter~0 48)} assume !(main_~c~0 >= main_~b~0); {13957#(< ~counter~0 48)} is VALID [2021-09-13 14:26:23,656 INFO L281 TraceCheckUtils]: 10: Hoare triple {13957#(< ~counter~0 48)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {13957#(< ~counter~0 48)} is VALID [2021-09-13 14:26:23,656 INFO L281 TraceCheckUtils]: 9: Hoare triple {13970#(< ~counter~0 47)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13957#(< ~counter~0 48)} is VALID [2021-09-13 14:26:23,657 INFO L281 TraceCheckUtils]: 8: Hoare triple {13970#(< ~counter~0 47)} 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 47)} is VALID [2021-09-13 14:26:23,657 INFO L281 TraceCheckUtils]: 7: Hoare triple {13970#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {13970#(< ~counter~0 47)} is VALID [2021-09-13 14:26:23,657 INFO L281 TraceCheckUtils]: 6: Hoare triple {13980#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13970#(< ~counter~0 47)} is VALID [2021-09-13 14:26:23,658 INFO L281 TraceCheckUtils]: 5: Hoare triple {13980#(< ~counter~0 46)} 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 46)} is VALID [2021-09-13 14:26:23,658 INFO L281 TraceCheckUtils]: 4: Hoare triple {13980#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond); {13980#(< ~counter~0 46)} is VALID [2021-09-13 14:26:23,658 INFO L281 TraceCheckUtils]: 3: Hoare triple {13980#(< ~counter~0 46)} 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 46)} is VALID [2021-09-13 14:26:23,658 INFO L281 TraceCheckUtils]: 2: Hoare triple {13980#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond); {13980#(< ~counter~0 46)} is VALID [2021-09-13 14:26:23,659 INFO L281 TraceCheckUtils]: 1: Hoare triple {13980#(< ~counter~0 46)} 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 46)} is VALID [2021-09-13 14:26:23,661 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 46)} is VALID [2021-09-13 14:26:23,661 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:26:23,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:23,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801956549] [2021-09-13 14:26:23,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:23,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145738022] [2021-09-13 14:26:23,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145738022] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:23,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:23,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-09-13 14:26:23,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27089097] [2021-09-13 14:26:23,663 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:26:23,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:23,663 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:26:23,713 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:23,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:26:23,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:26:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:26:23,714 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:26:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:26,785 INFO L93 Difference]: Finished difference Result 1205 states and 1584 transitions. [2021-09-13 14:26:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:26:26,786 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:26:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:26,786 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:26:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2021-09-13 14:26:26,788 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:26:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2021-09-13 14:26:26,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 281 transitions. [2021-09-13 14:26:27,010 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:26:27,059 INFO L225 Difference]: With dead ends: 1205 [2021-09-13 14:26:27,059 INFO L226 Difference]: Without dead ends: 876 [2021-09-13 14:26:27,062 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 112.02ms TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2021-09-13 14:26:27,062 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 327.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.69ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 350.53ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:27,063 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 456 Unknown, 0 Unchecked, 2.69ms Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 350.53ms Time] [2021-09-13 14:26:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-09-13 14:26:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 777. [2021-09-13 14:26:29,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:29,155 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:26:29,156 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:26:29,157 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:26:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:29,193 INFO L93 Difference]: Finished difference Result 876 states and 1091 transitions. [2021-09-13 14:26:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1091 transitions. [2021-09-13 14:26:29,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:29,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:29,196 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:26:29,197 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:26:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:29,235 INFO L93 Difference]: Finished difference Result 876 states and 1091 transitions. [2021-09-13 14:26:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1091 transitions. [2021-09-13 14:26:29,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:29,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:29,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:29,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:29,238 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:26:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1002 transitions. [2021-09-13 14:26:29,275 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1002 transitions. Word has length 31 [2021-09-13 14:26:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:29,276 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1002 transitions. [2021-09-13 14:26:29,276 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:26:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1002 transitions. [2021-09-13 14:26:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:26:29,277 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:29,277 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:26:29,305 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:26:29,491 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:26:29,491 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:26:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:29,492 INFO L82 PathProgramCache]: Analyzing trace with hash 13971671, now seen corresponding path program 2 times [2021-09-13 14:26:29,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:29,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021553953] [2021-09-13 14:26:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:29,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:29,497 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:29,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924243696] [2021-09-13 14:26:29,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:26:29,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:29,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:29,501 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:26:29,502 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:26:29,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:26:29,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:26:29,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:26:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:29,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:29,694 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:26:29,694 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:26:29,694 INFO L281 TraceCheckUtils]: 2: Hoare triple {18529#true} assume !(0 == assume_abort_if_not_~cond); {18529#true} is VALID [2021-09-13 14:26:29,694 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:26:29,694 INFO L281 TraceCheckUtils]: 4: Hoare triple {18529#true} assume !(0 == assume_abort_if_not_~cond); {18529#true} is VALID [2021-09-13 14:26:29,694 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:26:29,694 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:26:29,695 INFO L281 TraceCheckUtils]: 7: Hoare triple {18529#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {18529#true} is VALID [2021-09-13 14:26:29,695 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:26:29,695 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:26:29,695 INFO L281 TraceCheckUtils]: 10: Hoare triple {18529#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {18529#true} is VALID [2021-09-13 14:26:29,695 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:26:29,695 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:26:29,696 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:26:29,696 INFO L281 TraceCheckUtils]: 14: Hoare triple {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:26:29,696 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:26:29,697 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:26:29,697 INFO L281 TraceCheckUtils]: 17: Hoare triple {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:26:29,698 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:26:29,698 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:26:29,698 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:26:29,698 INFO L281 TraceCheckUtils]: 21: Hoare triple {18530#false} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {18530#false} is VALID [2021-09-13 14:26:29,698 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:26:29,698 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:26:29,698 INFO L281 TraceCheckUtils]: 24: Hoare triple {18530#false} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {18530#false} is VALID [2021-09-13 14:26:29,698 INFO L281 TraceCheckUtils]: 25: Hoare triple {18530#false} assume !(main_~c~0 >= main_~b~0); {18530#false} is VALID [2021-09-13 14:26:29,698 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:26:29,698 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:26:29,698 INFO L281 TraceCheckUtils]: 28: Hoare triple {18530#false} assume !(main_#t~post9 < 50);havoc main_#t~post9; {18530#false} is VALID [2021-09-13 14:26:29,698 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:26:29,698 INFO L281 TraceCheckUtils]: 30: Hoare triple {18530#false} assume 0 == __VERIFIER_assert_~cond; {18530#false} is VALID [2021-09-13 14:26:29,698 INFO L281 TraceCheckUtils]: 31: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2021-09-13 14:26:29,699 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:26:29,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:29,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:29,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021553953] [2021-09-13 14:26:29,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:29,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924243696] [2021-09-13 14:26:29,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924243696] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:29,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:29,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:26:29,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090305792] [2021-09-13 14:26:29,700 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:26:29,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:29,700 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:26:29,720 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:26:29,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:26:29,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:26:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:26:29,721 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:26:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:32,711 INFO L93 Difference]: Finished difference Result 1430 states and 1901 transitions. [2021-09-13 14:26:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:26:32,712 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:26:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:32,712 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:26:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2021-09-13 14:26:32,714 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:26:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2021-09-13 14:26:32,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2021-09-13 14:26:32,847 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:26:32,910 INFO L225 Difference]: With dead ends: 1430 [2021-09-13 14:26:32,911 INFO L226 Difference]: Without dead ends: 1068 [2021-09-13 14:26:32,911 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.96ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:26:32,912 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 156.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.29ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 157.48ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:32,912 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 1.29ms Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 157.48ms Time] [2021-09-13 14:26:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-09-13 14:26:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 747. [2021-09-13 14:26:34,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:34,934 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:34,934 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:34,935 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:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:34,982 INFO L93 Difference]: Finished difference Result 1068 states and 1400 transitions. [2021-09-13 14:26:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2021-09-13 14:26:34,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:34,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:34,986 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:34,986 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:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:35,035 INFO L93 Difference]: Finished difference Result 1068 states and 1400 transitions. [2021-09-13 14:26:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2021-09-13 14:26:35,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:35,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:35,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:35,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:35,039 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:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 967 transitions. [2021-09-13 14:26:35,070 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 967 transitions. Word has length 32 [2021-09-13 14:26:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:35,070 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 967 transitions. [2021-09-13 14:26:35,071 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:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 967 transitions. [2021-09-13 14:26:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:26:35,071 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:35,071 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:35,097 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:35,297 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:35,297 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:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1302269029, now seen corresponding path program 1 times [2021-09-13 14:26:35,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:35,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293522416] [2021-09-13 14:26:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:35,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:35,303 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:35,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064494241] [2021-09-13 14:26:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:35,305 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:35,306 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:35,307 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:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:35,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2021-09-13 14:26:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:35,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:35,874 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:35,874 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:35,874 INFO L281 TraceCheckUtils]: 2: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:26:35,875 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:35,876 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:35,876 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:35,877 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:35,877 INFO L281 TraceCheckUtils]: 7: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:35,877 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:35,878 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:35,878 INFO L281 TraceCheckUtils]: 10: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:35,878 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:35,879 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:35,880 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 < 50);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:35,880 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:35,881 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:35,881 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:35,882 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:35,882 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:35,883 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:35,883 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:35,884 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:35,884 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:35,885 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 < 50);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:35,885 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:35,886 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:35,886 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:35,887 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:35,887 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:35,888 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:35,888 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:35,889 INFO L281 TraceCheckUtils]: 31: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2021-09-13 14:26:35,889 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:35,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:36,146 INFO L281 TraceCheckUtils]: 31: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2021-09-13 14:26:36,147 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:36,147 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:36,148 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:36,148 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:36,148 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:36,149 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:36,149 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:36,151 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 < 50);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:36,151 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:36,153 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:36,154 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:36,155 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:36,155 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:36,155 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:36,156 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:36,156 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:36,157 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:36,158 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 < 50);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:36,160 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:36,160 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:36,160 INFO L281 TraceCheckUtils]: 10: Hoare triple {23817#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {23817#true} is VALID [2021-09-13 14:26:36,160 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:36,161 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:36,161 INFO L281 TraceCheckUtils]: 7: Hoare triple {23817#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {23817#true} is VALID [2021-09-13 14:26:36,161 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:36,161 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:36,161 INFO L281 TraceCheckUtils]: 4: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:26:36,161 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:36,161 INFO L281 TraceCheckUtils]: 2: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:26:36,161 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:36,161 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:36,161 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:36,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:36,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293522416] [2021-09-13 14:26:36,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:36,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064494241] [2021-09-13 14:26:36,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064494241] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:36,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:36,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2021-09-13 14:26:36,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803444030] [2021-09-13 14:26:36,162 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:36,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:36,163 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:36,204 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:36,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:26:36,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:26:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:26:36,205 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:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:39,463 INFO L93 Difference]: Finished difference Result 866 states and 1122 transitions. [2021-09-13 14:26:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:26:39,463 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:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:39,463 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:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2021-09-13 14:26:39,464 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:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2021-09-13 14:26:39,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 130 transitions. [2021-09-13 14:26:39,568 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:39,602 INFO L225 Difference]: With dead ends: 866 [2021-09-13 14:26:39,602 INFO L226 Difference]: Without dead ends: 864 [2021-09-13 14:26:39,602 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 293.81ms TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:26:39,603 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 246.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 248.77ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:39,603 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [21 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 248.77ms Time] [2021-09-13 14:26:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-09-13 14:26:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 595. [2021-09-13 14:26:41,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:41,345 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:41,345 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:41,346 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:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:41,394 INFO L93 Difference]: Finished difference Result 864 states and 1089 transitions. [2021-09-13 14:26:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2021-09-13 14:26:41,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:41,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:41,397 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:41,397 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:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:41,431 INFO L93 Difference]: Finished difference Result 864 states and 1089 transitions. [2021-09-13 14:26:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2021-09-13 14:26:41,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:41,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:41,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:41,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:41,433 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:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 754 transitions. [2021-09-13 14:26:41,452 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 754 transitions. Word has length 32 [2021-09-13 14:26:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:41,452 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 754 transitions. [2021-09-13 14:26:41,453 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:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 754 transitions. [2021-09-13 14:26:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-09-13 14:26:41,454 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:41,454 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:41,479 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:41,675 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:41,675 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:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:41,676 INFO L82 PathProgramCache]: Analyzing trace with hash 885134474, now seen corresponding path program 1 times [2021-09-13 14:26:41,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:41,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507283918] [2021-09-13 14:26:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:41,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:41,685 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:41,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551005493] [2021-09-13 14:26:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:41,690 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:41,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:41,691 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:41,692 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:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:41,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2021-09-13 14:26:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:41,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:43,090 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:43,090 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:43,090 INFO L281 TraceCheckUtils]: 2: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:43,090 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:43,091 INFO L281 TraceCheckUtils]: 4: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:43,103 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:43,104 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:43,104 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 < 50);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:43,105 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:43,106 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:43,106 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 < 50);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:43,107 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:43,107 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:43,108 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 < 50);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:43,109 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:43,110 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:43,110 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:43,111 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:43,111 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:43,112 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:43,113 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:43,113 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:43,114 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:43,115 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:43,115 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 < 50);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:43,116 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:43,117 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:43,117 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:43,118 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 < 50);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:43,119 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:43,120 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:43,120 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:43,120 INFO L281 TraceCheckUtils]: 32: Hoare triple {27811#false} assume !false; {27811#false} is VALID [2021-09-13 14:26:43,121 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:43,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:44,458 INFO L281 TraceCheckUtils]: 32: Hoare triple {27811#false} assume !false; {27811#false} is VALID [2021-09-13 14:26:44,459 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:44,459 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:44,460 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:44,460 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 < 50);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:44,460 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:45,051 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:45,052 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:45,052 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 < 50);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:45,053 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:45,083 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:45,084 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:45,084 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:45,085 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:45,085 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:45,085 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:45,086 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:45,086 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:45,087 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:45,087 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 < 50);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:45,088 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:45,090 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:45,090 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 < 50);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:45,091 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:45,092 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:45,092 INFO L281 TraceCheckUtils]: 7: Hoare triple {27810#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {27810#true} is VALID [2021-09-13 14:26:45,092 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:45,092 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:45,092 INFO L281 TraceCheckUtils]: 4: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:45,092 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:45,092 INFO L281 TraceCheckUtils]: 2: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:45,092 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:45,092 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:45,092 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:45,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:45,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507283918] [2021-09-13 14:26:45,093 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:45,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551005493] [2021-09-13 14:26:45,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551005493] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:45,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:45,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-09-13 14:26:45,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214882717] [2021-09-13 14:26:45,093 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:45,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:45,094 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:45,216 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:45,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 14:26:45,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 14:26:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:26:45,217 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:27:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:02,957 INFO L93 Difference]: Finished difference Result 1157 states and 1472 transitions. [2021-09-13 14:27:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-09-13 14:27:02,958 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:27:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:02,958 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:27:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 324 transitions. [2021-09-13 14:27:02,959 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:27:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 324 transitions. [2021-09-13 14:27:02,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 324 transitions. [2021-09-13 14:27:03,747 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:27:03,795 INFO L225 Difference]: With dead ends: 1157 [2021-09-13 14:27:03,795 INFO L226 Difference]: Without dead ends: 1147 [2021-09-13 14:27:03,796 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 4036.90ms TimeCoverageRelationStatistics Valid=692, Invalid=3090, Unknown=0, NotChecked=0, Total=3782 [2021-09-13 14:27:03,796 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 467 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5247.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.66ms SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5264.95ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:03,796 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 0 Invalid, 1294 Unknown, 0 Unchecked, 6.66ms Time], IncrementalHoareTripleChecker [167 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 5264.95ms Time] [2021-09-13 14:27:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-09-13 14:27:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 785. [2021-09-13 14:27:06,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:06,796 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:27:06,797 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:27:06,798 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:27:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:06,850 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2021-09-13 14:27:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1440 transitions. [2021-09-13 14:27:06,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:06,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:06,853 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:27:06,854 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:27:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:06,906 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2021-09-13 14:27:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1440 transitions. [2021-09-13 14:27:06,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:06,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:06,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:06,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:06,910 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:27:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1013 transitions. [2021-09-13 14:27:06,943 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1013 transitions. Word has length 33 [2021-09-13 14:27:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:06,943 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1013 transitions. [2021-09-13 14:27:06,943 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:27:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1013 transitions. [2021-09-13 14:27:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:27:06,944 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:06,944 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:27:06,969 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:27:07,156 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:27:07,157 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:27:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:07,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1517440196, now seen corresponding path program 1 times [2021-09-13 14:27:07,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:07,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216913519] [2021-09-13 14:27:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:07,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:07,164 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:07,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561700950] [2021-09-13 14:27:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:07,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:07,169 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:27:07,170 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:27:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:07,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:27:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:07,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:07,646 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:27:07,647 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:27:07,647 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:27:07,648 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:27:07,648 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:27:07,649 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:27:07,650 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:27:07,650 INFO L281 TraceCheckUtils]: 7: Hoare triple {33126#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {33126#(<= ~counter~0 1)} is VALID [2021-09-13 14:27:07,651 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:27:07,651 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:27:07,652 INFO L281 TraceCheckUtils]: 10: Hoare triple {33136#(<= ~counter~0 2)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {33136#(<= ~counter~0 2)} is VALID [2021-09-13 14:27:07,652 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:27:07,653 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:27:07,654 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:27:07,654 INFO L281 TraceCheckUtils]: 14: Hoare triple {33149#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {33149#(<= ~counter~0 3)} is VALID [2021-09-13 14:27:07,654 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:27:07,655 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:27:07,656 INFO L281 TraceCheckUtils]: 17: Hoare triple {33159#(<= ~counter~0 4)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {33159#(<= ~counter~0 4)} is VALID [2021-09-13 14:27:07,656 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:27:07,657 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:27:07,657 INFO L281 TraceCheckUtils]: 20: Hoare triple {33169#(<= ~counter~0 5)} assume !!(main_#t~post11 < 50);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:27:07,658 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:27:07,658 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:27:07,658 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:27:07,659 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:27:07,659 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:27:07,660 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:27:07,660 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:27:07,660 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:27:07,661 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:27:07,662 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:27:07,662 INFO L281 TraceCheckUtils]: 31: Hoare triple {33203#(<= ~counter~0 6)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {33203#(<= ~counter~0 6)} is VALID [2021-09-13 14:27:07,662 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:27:07,663 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:27:07,663 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:27:07,664 INFO L281 TraceCheckUtils]: 35: Hoare triple {33216#(<= |ULTIMATE.start_main_#t~post9| 6)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {33103#false} is VALID [2021-09-13 14:27:07,664 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:27:07,664 INFO L281 TraceCheckUtils]: 37: Hoare triple {33103#false} assume 0 == __VERIFIER_assert_~cond; {33103#false} is VALID [2021-09-13 14:27:07,664 INFO L281 TraceCheckUtils]: 38: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2021-09-13 14:27:07,664 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:27:07,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:08,078 INFO L281 TraceCheckUtils]: 38: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2021-09-13 14:27:08,078 INFO L281 TraceCheckUtils]: 37: Hoare triple {33103#false} assume 0 == __VERIFIER_assert_~cond; {33103#false} is VALID [2021-09-13 14:27:08,078 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:27:08,078 INFO L281 TraceCheckUtils]: 35: Hoare triple {33238#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {33103#false} is VALID [2021-09-13 14:27:08,079 INFO L281 TraceCheckUtils]: 34: Hoare triple {33242#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33238#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:27:08,079 INFO L281 TraceCheckUtils]: 33: Hoare triple {33242#(< ~counter~0 50)} 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 50)} is VALID [2021-09-13 14:27:08,079 INFO L281 TraceCheckUtils]: 32: Hoare triple {33242#(< ~counter~0 50)} assume !(main_~c~0 >= main_~b~0); {33242#(< ~counter~0 50)} is VALID [2021-09-13 14:27:08,080 INFO L281 TraceCheckUtils]: 31: Hoare triple {33242#(< ~counter~0 50)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {33242#(< ~counter~0 50)} is VALID [2021-09-13 14:27:08,080 INFO L281 TraceCheckUtils]: 30: Hoare triple {33255#(< ~counter~0 49)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33242#(< ~counter~0 50)} is VALID [2021-09-13 14:27:08,081 INFO L281 TraceCheckUtils]: 29: Hoare triple {33255#(< ~counter~0 49)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,081 INFO L281 TraceCheckUtils]: 28: Hoare triple {33255#(< ~counter~0 49)} assume !(main_~c~0 >= 2 * main_~v~0); {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,081 INFO L281 TraceCheckUtils]: 27: Hoare triple {33255#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,082 INFO L281 TraceCheckUtils]: 26: Hoare triple {33255#(< ~counter~0 49)} __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 49)} is VALID [2021-09-13 14:27:08,082 INFO L281 TraceCheckUtils]: 25: Hoare triple {33255#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,082 INFO L281 TraceCheckUtils]: 24: Hoare triple {33255#(< ~counter~0 49)} __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 49)} is VALID [2021-09-13 14:27:08,082 INFO L281 TraceCheckUtils]: 23: Hoare triple {33255#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,083 INFO L281 TraceCheckUtils]: 22: Hoare triple {33255#(< ~counter~0 49)} __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 49)} is VALID [2021-09-13 14:27:08,083 INFO L281 TraceCheckUtils]: 21: Hoare triple {33255#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,093 INFO L281 TraceCheckUtils]: 20: Hoare triple {33255#(< ~counter~0 49)} assume !!(main_#t~post11 < 50);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 49)} is VALID [2021-09-13 14:27:08,095 INFO L281 TraceCheckUtils]: 19: Hoare triple {33289#(< ~counter~0 48)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {33255#(< ~counter~0 49)} is VALID [2021-09-13 14:27:08,095 INFO L281 TraceCheckUtils]: 18: Hoare triple {33289#(< ~counter~0 48)} 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 48)} is VALID [2021-09-13 14:27:08,095 INFO L281 TraceCheckUtils]: 17: Hoare triple {33289#(< ~counter~0 48)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {33289#(< ~counter~0 48)} is VALID [2021-09-13 14:27:08,096 INFO L281 TraceCheckUtils]: 16: Hoare triple {33299#(< ~counter~0 47)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33289#(< ~counter~0 48)} is VALID [2021-09-13 14:27:08,096 INFO L281 TraceCheckUtils]: 15: Hoare triple {33299#(< ~counter~0 47)} 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 47)} is VALID [2021-09-13 14:27:08,096 INFO L281 TraceCheckUtils]: 14: Hoare triple {33299#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {33299#(< ~counter~0 47)} is VALID [2021-09-13 14:27:08,097 INFO L281 TraceCheckUtils]: 13: Hoare triple {33309#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33299#(< ~counter~0 47)} is VALID [2021-09-13 14:27:08,097 INFO L281 TraceCheckUtils]: 12: Hoare triple {33309#(< ~counter~0 46)} 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 46)} is VALID [2021-09-13 14:27:08,097 INFO L281 TraceCheckUtils]: 11: Hoare triple {33309#(< ~counter~0 46)} assume !(main_~c~0 >= main_~b~0); {33309#(< ~counter~0 46)} is VALID [2021-09-13 14:27:08,098 INFO L281 TraceCheckUtils]: 10: Hoare triple {33309#(< ~counter~0 46)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {33309#(< ~counter~0 46)} is VALID [2021-09-13 14:27:08,098 INFO L281 TraceCheckUtils]: 9: Hoare triple {33322#(< ~counter~0 45)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33309#(< ~counter~0 46)} is VALID [2021-09-13 14:27:08,098 INFO L281 TraceCheckUtils]: 8: Hoare triple {33322#(< ~counter~0 45)} 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 45)} is VALID [2021-09-13 14:27:08,099 INFO L281 TraceCheckUtils]: 7: Hoare triple {33322#(< ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {33322#(< ~counter~0 45)} is VALID [2021-09-13 14:27:08,099 INFO L281 TraceCheckUtils]: 6: Hoare triple {33332#(< ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33322#(< ~counter~0 45)} is VALID [2021-09-13 14:27:08,099 INFO L281 TraceCheckUtils]: 5: Hoare triple {33332#(< ~counter~0 44)} 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 44)} is VALID [2021-09-13 14:27:08,100 INFO L281 TraceCheckUtils]: 4: Hoare triple {33332#(< ~counter~0 44)} assume !(0 == assume_abort_if_not_~cond); {33332#(< ~counter~0 44)} is VALID [2021-09-13 14:27:08,100 INFO L281 TraceCheckUtils]: 3: Hoare triple {33332#(< ~counter~0 44)} 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 44)} is VALID [2021-09-13 14:27:08,100 INFO L281 TraceCheckUtils]: 2: Hoare triple {33332#(< ~counter~0 44)} assume !(0 == assume_abort_if_not_~cond); {33332#(< ~counter~0 44)} is VALID [2021-09-13 14:27:08,101 INFO L281 TraceCheckUtils]: 1: Hoare triple {33332#(< ~counter~0 44)} 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 44)} is VALID [2021-09-13 14:27:08,101 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 44)} is VALID [2021-09-13 14:27:08,102 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:27:08,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:08,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216913519] [2021-09-13 14:27:08,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:08,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561700950] [2021-09-13 14:27:08,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561700950] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:08,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:08,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-09-13 14:27:08,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014213755] [2021-09-13 14:27:08,103 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:27:08,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:08,104 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:27:08,197 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:27:08,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-09-13 14:27:08,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-09-13 14:27:08,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:27:08,198 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:27:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:15,659 INFO L93 Difference]: Finished difference Result 1756 states and 2299 transitions. [2021-09-13 14:27:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-09-13 14:27:15,660 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:27:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:15,660 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:27:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 340 transitions. [2021-09-13 14:27:15,662 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:27:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 340 transitions. [2021-09-13 14:27:15,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 340 transitions. [2021-09-13 14:27:15,894 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:27:16,014 INFO L225 Difference]: With dead ends: 1756 [2021-09-13 14:27:16,014 INFO L226 Difference]: Without dead ends: 1752 [2021-09-13 14:27:16,015 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 221.80ms TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2021-09-13 14:27:16,015 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 396.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.96ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 399.57ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:16,015 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 2.96ms Time], IncrementalHoareTripleChecker [78 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 399.57ms Time] [2021-09-13 14:27:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-09-13 14:27:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1354. [2021-09-13 14:27:21,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:21,183 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:27:21,184 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:27:21,185 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:27:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:21,271 INFO L93 Difference]: Finished difference Result 1752 states and 2219 transitions. [2021-09-13 14:27:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2219 transitions. [2021-09-13 14:27:21,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:21,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:21,275 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:27:21,276 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:27:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:21,379 INFO L93 Difference]: Finished difference Result 1752 states and 2219 transitions. [2021-09-13 14:27:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2219 transitions. [2021-09-13 14:27:21,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:21,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:21,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:21,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:21,382 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:27:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1753 transitions. [2021-09-13 14:27:21,447 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1753 transitions. Word has length 39 [2021-09-13 14:27:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:21,447 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 1753 transitions. [2021-09-13 14:27:21,447 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:27:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1753 transitions. [2021-09-13 14:27:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:27:21,448 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:21,448 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:27:21,465 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:27:21,648 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:27:21,649 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:27:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1573117064, now seen corresponding path program 1 times [2021-09-13 14:27:21,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:21,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019744911] [2021-09-13 14:27:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:21,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:21,664 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:21,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058797726] [2021-09-13 14:27:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:21,664 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:21,665 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:27:21,680 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:27:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:21,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:27:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:21,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:21,924 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:27:21,924 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:27:21,924 INFO L281 TraceCheckUtils]: 2: Hoare triple {41174#true} assume !(0 == assume_abort_if_not_~cond); {41174#true} is VALID [2021-09-13 14:27:21,924 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:27:21,924 INFO L281 TraceCheckUtils]: 4: Hoare triple {41174#true} assume !(0 == assume_abort_if_not_~cond); {41174#true} is VALID [2021-09-13 14:27:21,925 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:27:21,925 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:27:21,925 INFO L281 TraceCheckUtils]: 7: Hoare triple {41174#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {41174#true} is VALID [2021-09-13 14:27:21,925 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:27:21,925 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:27:21,925 INFO L281 TraceCheckUtils]: 10: Hoare triple {41174#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {41174#true} is VALID [2021-09-13 14:27:21,925 INFO L281 TraceCheckUtils]: 11: Hoare triple {41174#true} assume !(main_~c~0 >= main_~b~0); {41174#true} is VALID [2021-09-13 14:27:21,925 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:27:21,925 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:27:21,925 INFO L281 TraceCheckUtils]: 14: Hoare triple {41174#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {41174#true} is VALID [2021-09-13 14:27:21,926 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:27:21,926 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:27:21,926 INFO L281 TraceCheckUtils]: 17: Hoare triple {41174#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {41174#true} is VALID [2021-09-13 14:27:21,945 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:27:21,945 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:27:21,946 INFO L281 TraceCheckUtils]: 20: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post11 < 50);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:27:21,946 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:27:21,947 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:27:21,947 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:27:21,947 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:27:21,948 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:27:21,948 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:27:21,948 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:27:21,949 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:27:21,950 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:27:21,950 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:27:21,951 INFO L281 TraceCheckUtils]: 31: Hoare triple {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:27:21,951 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:27:21,951 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:27:21,951 INFO L281 TraceCheckUtils]: 34: Hoare triple {41175#false} assume !!(main_#t~post11 < 50);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:27:21,951 INFO L281 TraceCheckUtils]: 35: Hoare triple {41175#false} assume !(0 == __VERIFIER_assert_~cond); {41175#false} is VALID [2021-09-13 14:27:21,952 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:27:21,952 INFO L281 TraceCheckUtils]: 37: Hoare triple {41175#false} assume !(0 == __VERIFIER_assert_~cond); {41175#false} is VALID [2021-09-13 14:27:21,952 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:27:21,952 INFO L281 TraceCheckUtils]: 39: Hoare triple {41175#false} assume 0 == __VERIFIER_assert_~cond; {41175#false} is VALID [2021-09-13 14:27:21,952 INFO L281 TraceCheckUtils]: 40: Hoare triple {41175#false} assume !false; {41175#false} is VALID [2021-09-13 14:27:21,952 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:27:21,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:21,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:21,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019744911] [2021-09-13 14:27:21,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:21,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058797726] [2021-09-13 14:27:21,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058797726] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:21,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:21,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:27:21,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433979534] [2021-09-13 14:27:21,954 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:27:21,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:21,954 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:27:21,981 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:27:21,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:27:21,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:27:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:21,982 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:27:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:29,684 INFO L93 Difference]: Finished difference Result 2784 states and 3644 transitions. [2021-09-13 14:27:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:27:29,685 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:27:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:29,685 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:27:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2021-09-13 14:27:29,686 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:27:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2021-09-13 14:27:29,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2021-09-13 14:27:29,760 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:27:29,890 INFO L225 Difference]: With dead ends: 2784 [2021-09-13 14:27:29,891 INFO L226 Difference]: Without dead ends: 1767 [2021-09-13 14:27:29,892 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.76ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:27:29,892 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 113.06ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:29,892 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 113.06ms Time] [2021-09-13 14:27:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2021-09-13 14:27:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1620. [2021-09-13 14:27:37,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:37,266 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:27:37,267 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:27:37,268 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:27:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:37,355 INFO L93 Difference]: Finished difference Result 1767 states and 2267 transitions. [2021-09-13 14:27:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2267 transitions. [2021-09-13 14:27:37,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:37,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:37,358 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:27:37,359 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:27:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:37,467 INFO L93 Difference]: Finished difference Result 1767 states and 2267 transitions. [2021-09-13 14:27:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2267 transitions. [2021-09-13 14:27:37,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:37,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:37,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:37,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:37,470 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:27:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2083 transitions. [2021-09-13 14:27:37,567 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2083 transitions. Word has length 41 [2021-09-13 14:27:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:37,567 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 2083 transitions. [2021-09-13 14:27:37,568 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:27:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2083 transitions. [2021-09-13 14:27:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:27:37,568 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:37,568 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:27:37,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-09-13 14:27:37,769 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:27:37,769 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:27:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:37,770 INFO L82 PathProgramCache]: Analyzing trace with hash -149759960, now seen corresponding path program 2 times [2021-09-13 14:27:37,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:37,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459249054] [2021-09-13 14:27:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:37,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:37,777 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:37,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405709545] [2021-09-13 14:27:37,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:27:37,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:37,781 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:27:37,782 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:27:37,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-09-13 14:27:37,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:27:37,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:27:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:37,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:38,080 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:27:38,080 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:27:38,081 INFO L281 TraceCheckUtils]: 2: Hoare triple {50949#true} assume !(0 == assume_abort_if_not_~cond); {50949#true} is VALID [2021-09-13 14:27:38,081 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:27:38,081 INFO L281 TraceCheckUtils]: 4: Hoare triple {50949#true} assume !(0 == assume_abort_if_not_~cond); {50949#true} is VALID [2021-09-13 14:27:38,081 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:27:38,081 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:27:38,081 INFO L281 TraceCheckUtils]: 7: Hoare triple {50949#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {50949#true} is VALID [2021-09-13 14:27:38,081 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:27:38,081 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:27:38,081 INFO L281 TraceCheckUtils]: 10: Hoare triple {50949#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {50949#true} is VALID [2021-09-13 14:27:38,081 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:27:38,081 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:27:38,081 INFO L281 TraceCheckUtils]: 13: Hoare triple {50949#true} assume !!(main_#t~post11 < 50);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:27:38,081 INFO L281 TraceCheckUtils]: 14: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:27:38,081 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:27:38,081 INFO L281 TraceCheckUtils]: 16: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:27:38,082 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:27:38,082 INFO L281 TraceCheckUtils]: 18: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:27:38,082 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:27:38,082 INFO L281 TraceCheckUtils]: 20: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:27:38,082 INFO L281 TraceCheckUtils]: 21: Hoare triple {50949#true} assume !(main_~c~0 >= 2 * main_~v~0); {50949#true} is VALID [2021-09-13 14:27:38,082 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:27:38,082 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:27:38,082 INFO L281 TraceCheckUtils]: 24: Hoare triple {50949#true} assume !!(main_#t~post10 < 50);havoc main_#t~post10; {50949#true} is VALID [2021-09-13 14:27:38,082 INFO L281 TraceCheckUtils]: 25: Hoare triple {50949#true} assume !(main_~c~0 >= main_~b~0); {50949#true} is VALID [2021-09-13 14:27:38,082 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:27:38,082 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:27:38,082 INFO L281 TraceCheckUtils]: 28: Hoare triple {50949#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {50949#true} is VALID [2021-09-13 14:27:38,083 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:27:38,083 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:27:38,083 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 < 50);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:27:38,084 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:27:38,084 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:27:38,084 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 < 50);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:27:38,085 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:27:38,085 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:27:38,085 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:27:38,086 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:27:38,086 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:27:38,086 INFO L281 TraceCheckUtils]: 40: Hoare triple {50950#false} assume !false; {50950#false} is VALID [2021-09-13 14:27:38,086 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:27:38,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:38,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:38,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459249054] [2021-09-13 14:27:38,087 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:38,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405709545] [2021-09-13 14:27:38,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405709545] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:38,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:38,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:27:38,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426092862] [2021-09-13 14:27:38,087 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:27:38,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:38,088 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:27:38,113 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:27:38,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:27:38,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:27:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:27:38,114 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:27:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:46,521 INFO L93 Difference]: Finished difference Result 1761 states and 2260 transitions. [2021-09-13 14:27:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:27:46,521 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:27:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:46,521 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:27:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2021-09-13 14:27:46,522 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:27:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2021-09-13 14:27:46,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2021-09-13 14:27:46,566 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:27:46,684 INFO L225 Difference]: With dead ends: 1761 [2021-09-13 14:27:46,684 INFO L226 Difference]: Without dead ends: 1759 [2021-09-13 14:27:46,684 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.70ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:27:46,685 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.40ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.41ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:46,685 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.40ms Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 73.41ms Time] [2021-09-13 14:27:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2021-09-13 14:27:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1720. [2021-09-13 14:27:54,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:54,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:54,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:54,990 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:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:55,107 INFO L93 Difference]: Finished difference Result 1759 states and 2226 transitions. [2021-09-13 14:27:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2226 transitions. [2021-09-13 14:27:55,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:55,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:55,110 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:55,111 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:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:55,196 INFO L93 Difference]: Finished difference Result 1759 states and 2226 transitions. [2021-09-13 14:27:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2226 transitions. [2021-09-13 14:27:55,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:55,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:55,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:55,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:55,200 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:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2189 transitions. [2021-09-13 14:27:55,311 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2189 transitions. Word has length 41 [2021-09-13 14:27:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:55,311 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2189 transitions. [2021-09-13 14:27:55,311 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:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2189 transitions. [2021-09-13 14:27:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-09-13 14:27:55,312 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:55,312 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:55,328 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:55,512 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:55,513 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:55,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:55,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1891302024, now seen corresponding path program 1 times [2021-09-13 14:27:55,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:55,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467332304] [2021-09-13 14:27:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:55,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:55,519 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:55,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429660515] [2021-09-13 14:27:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:55,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:55,520 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:55,522 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:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:55,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjunts are in the unsatisfiable core [2021-09-13 14:27:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:55,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:58,614 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:58,614 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:58,614 INFO L281 TraceCheckUtils]: 2: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:27:58,614 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:58,614 INFO L281 TraceCheckUtils]: 4: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:27:58,615 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:58,615 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:58,616 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 < 50);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:58,616 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:58,616 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:58,617 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 < 50);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:58,617 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:58,618 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:58,618 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 < 50);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:58,618 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:58,619 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:58,619 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:58,620 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:58,620 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:58,621 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:58,621 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:58,622 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:58,622 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:58,623 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 < 50);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:58,623 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:58,624 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:58,633 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:58,634 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:58,635 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:58,636 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:58,637 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:58,637 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:58,641 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:58,642 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:58,643 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 < 50);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:58,644 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:58,644 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:58,645 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 < 50);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:58,646 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:58,646 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:58,647 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:58,648 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:58,648 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:58,648 INFO L281 TraceCheckUtils]: 43: Hoare triple {59471#false} assume !false; {59471#false} is VALID [2021-09-13 14:27:58,649 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:58,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:10,365 INFO L281 TraceCheckUtils]: 43: Hoare triple {59471#false} assume !false; {59471#false} is VALID [2021-09-13 14:28:10,365 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:28:10,365 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:28:10,366 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:28:12,368 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:28:12,368 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:28:12,369 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 < 50);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:28:12,369 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:28:12,369 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:28:12,370 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 < 50);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:28:12,370 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:28:12,373 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:28:12,374 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:28:12,374 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:28:12,375 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:28:12,375 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:28:12,375 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:28:12,375 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:28:12,376 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:28:12,376 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:28:12,376 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 < 50);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:28:12,377 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:28:12,380 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:28:12,380 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:28:12,380 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:28:12,387 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:28:12,387 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:28:12,388 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:28:12,388 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:28:12,389 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:28:12,389 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 < 50);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:28:12,389 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:28:12,393 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:28:12,393 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 < 50);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:28:12,394 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:28:12,394 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:28:12,394 INFO L281 TraceCheckUtils]: 7: Hoare triple {59470#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9; {59470#true} is VALID [2021-09-13 14:28:12,395 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:28:12,395 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:28:12,395 INFO L281 TraceCheckUtils]: 4: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:28:12,395 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:28:12,395 INFO L281 TraceCheckUtils]: 2: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:28:12,395 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:28:12,395 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:28:12,396 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:28:12,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:12,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467332304] [2021-09-13 14:28:12,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:12,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429660515] [2021-09-13 14:28:12,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429660515] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:12,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:12,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-09-13 14:28:12,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887316940] [2021-09-13 14:28:12,398 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:28:12,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:12,398 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:28:14,500 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:28:14,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-09-13 14:28:14,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-09-13 14:28:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2021-09-13 14:28:14,501 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:28:29,983 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:28:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-09-13 14:28:29,987 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 5172.85ms TimeCoverageRelationStatistics Valid=1008, Invalid=2184, Unknown=0, NotChecked=0, Total=3192 [2021-09-13 14:28:29,987 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 482 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 145 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4013.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.65ms SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4021.37ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:29,988 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 0 Invalid, 811 Unknown, 0 Unchecked, 4.65ms Time], IncrementalHoareTripleChecker [145 Valid, 665 Invalid, 1 Unknown, 0 Unchecked, 4021.37ms Time] [2021-09-13 14:28:30,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-09-13 14:28:30,189 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:28:30,190 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@74dc915f 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:28:30,193 INFO L158 Benchmark]: Toolchain (without parser) took 155155.31ms. Allocated memory was 58.7MB in the beginning and 299.9MB in the end (delta: 241.2MB). Free memory was 38.1MB in the beginning and 233.8MB in the end (delta: -195.6MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2021-09-13 14:28:30,193 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:30,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.18ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 42.7MB in the end (delta: -4.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-09-13 14:28:30,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.21ms. Allocated memory is still 58.7MB. Free memory was 42.5MB in the beginning and 40.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:30,194 INFO L158 Benchmark]: Boogie Preprocessor took 39.10ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 39.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:30,194 INFO L158 Benchmark]: RCFGBuilder took 332.60ms. Allocated memory is still 58.7MB. Free memory was 39.3MB in the beginning and 28.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:28:30,194 INFO L158 Benchmark]: TraceAbstraction took 154477.35ms. Allocated memory was 58.7MB in the beginning and 299.9MB in the end (delta: 241.2MB). Free memory was 27.4MB in the beginning and 233.8MB in the end (delta: -206.4MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2021-09-13 14:28:30,195 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.19ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.18ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 42.7MB in the end (delta: -4.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.21ms. Allocated memory is still 58.7MB. Free memory was 42.5MB in the beginning and 40.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.10ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 39.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.60ms. Allocated memory is still 58.7MB. Free memory was 39.3MB in the beginning and 28.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 154477.35ms. Allocated memory was 58.7MB in the beginning and 299.9MB in the end (delta: 241.2MB). Free memory was 27.4MB in the beginning and 233.8MB in the end (delta: -206.4MB). Peak memory consumption was 36.6MB. 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@74dc915f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@74dc915f: 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:28:30,234 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:28:32,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:28:32,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:28:32,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:28:32,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:28:32,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:28:32,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:28:32,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:28:32,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:28:32,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:28:32,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:28:32,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:28:32,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:28:32,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:28:32,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:28:32,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:28:32,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:28:32,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:28:32,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:28:32,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:28:32,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:28:32,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:28:32,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:28:32,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:28:32,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:28:32,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:28:32,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:28:32,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:28:32,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:28:32,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:28:32,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:28:32,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:28:32,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:28:32,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:28:32,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:28:32,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:28:32,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:28:32,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:28:32,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:28:32,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:28:32,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:28:32,255 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:28:32,291 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:28:32,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:28:32,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:28:32,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:28:32,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:28:32,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:28:32,295 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:28:32,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:28:32,296 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:28:32,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:28:32,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:28:32,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:28:32,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:28:32,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:28:32,297 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:28:32,297 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:28:32,298 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:28:32,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:28:32,298 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:28:32,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:28:32,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:28:32,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:28:32,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:28:32,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:28:32,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:28:32,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:28:32,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:28:32,300 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:28:32,300 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:28:32,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:28:32,300 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:28:32,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:28:32,301 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 -> 26441863cbddcb0f41ea7f2e43c89533e1f12930 [2021-09-13 14:28:32,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:28:32,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:28:32,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:28:32,624 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:28:32,624 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:28:32,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2021-09-13 14:28:32,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19035555b/11f0f81c39304a2dadb9731493529b81/FLAG98fa02856 [2021-09-13 14:28:33,106 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:28:33,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound50.c [2021-09-13 14:28:33,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19035555b/11f0f81c39304a2dadb9731493529b81/FLAG98fa02856 [2021-09-13 14:28:33,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19035555b/11f0f81c39304a2dadb9731493529b81 [2021-09-13 14:28:33,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:28:33,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:28:33,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:28:33,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:28:33,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:28:33,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8a0292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33, skipping insertion in model container [2021-09-13 14:28:33,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:28:33,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:28:33,704 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_unwindbound50.c[490,503] [2021-09-13 14:28:33,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:28:33,736 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:28:33,780 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_unwindbound50.c[490,503] [2021-09-13 14:28:33,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:28:33,811 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:28:33,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33 WrapperNode [2021-09-13 14:28:33,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:28:33,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:28:33,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:28:33,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:28:33,819 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:28:33" (1/1) ... [2021-09-13 14:28:33,826 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:28:33" (1/1) ... [2021-09-13 14:28:33,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:28:33,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:28:33,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:28:33,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:28:33,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:28:33,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:28:33,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:28:33,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:28:33,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (1/1) ... [2021-09-13 14:28:33,883 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:28:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:33,901 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:28:33,903 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:28:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:28:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:28:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:28:33,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:28:38,019 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:28:38,019 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-09-13 14:28:38,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:28:38 BoogieIcfgContainer [2021-09-13 14:28:38,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:28:38,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:28:38,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:28:38,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:28:38,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:28:33" (1/3) ... [2021-09-13 14:28:38,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b287945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:28:38, skipping insertion in model container [2021-09-13 14:28:38,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:33" (2/3) ... [2021-09-13 14:28:38,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b287945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:28:38, skipping insertion in model container [2021-09-13 14:28:38,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:28:38" (3/3) ... [2021-09-13 14:28:38,028 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound50.c [2021-09-13 14:28:38,033 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:28:38,033 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:28:38,072 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:28:38,077 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:28:38,077 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:28:38,092 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:28:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:28:38,096 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:38,096 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:38,097 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:28:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1233339761, now seen corresponding path program 1 times [2021-09-13 14:28:38,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:28:38,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395802388] [2021-09-13 14:28:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:38,113 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:28:38,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:28:38,122 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:28:38,123 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:28:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:38,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:28:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:38,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:38,388 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:28:38,388 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:28:38,389 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:28:38,389 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:28:38,390 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:28:38,390 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:28:38,390 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:28:38,390 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:28:38,391 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:28:38,391 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:28:38,392 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:38,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:38,438 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:28:38,439 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:28:38,439 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:28:38,439 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:28:38,440 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:28:38,440 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:28:38,440 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:28:38,441 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:28:38,441 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:28:38,441 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:28:38,441 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:38,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:28:38,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395802388] [2021-09-13 14:28:38,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395802388] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:38,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:38,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:28:38,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216125748] [2021-09-13 14:28:38,454 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:28:38,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:38,457 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:28:38,554 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:28:38,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:28:38,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:28:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:28:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:28:38,573 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:28:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:41,302 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-09-13 14:28:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:28:41,303 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:28:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:41,308 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:28:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:28:41,313 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:28:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:28:41,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2021-09-13 14:28:41,884 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:28:41,892 INFO L225 Difference]: With dead ends: 77 [2021-09-13 14:28:41,893 INFO L226 Difference]: Without dead ends: 36 [2021-09-13 14:28:41,895 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.14ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:28:41,898 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1289.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.21ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1292.14ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:41,899 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 1.21ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1292.14ms Time] [2021-09-13 14:28:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-13 14:28:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-13 14:28:41,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:41,925 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:28:41,926 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:28:41,926 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:28:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:41,929 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:28:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:28:41,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:41,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:41,930 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:28:41,931 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:28:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:41,933 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:28:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:28:41,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:41,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:41,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:41,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:41,935 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:28:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-09-13 14:28:41,937 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2021-09-13 14:28:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:41,938 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-09-13 14:28:41,938 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:28:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:28:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:28:41,939 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:41,939 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:41,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:42,153 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:28:42,153 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:28:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1507359540, now seen corresponding path program 1 times [2021-09-13 14:28:42,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:28:42,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615786952] [2021-09-13 14:28:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:42,155 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:28:42,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:28:42,158 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:28:42,164 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:28:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:28:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:42,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:42,516 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:28:42,516 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:28:42,517 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:28:42,518 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:28:42,518 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:28:42,519 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:28:42,519 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:28:42,520 INFO L281 TraceCheckUtils]: 7: Hoare triple {335#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} assume !~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {312#false} is VALID [2021-09-13 14:28:42,520 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:28:42,520 INFO L281 TraceCheckUtils]: 9: Hoare triple {312#false} assume 0bv32 == __VERIFIER_assert_~cond; {312#false} is VALID [2021-09-13 14:28:42,521 INFO L281 TraceCheckUtils]: 10: Hoare triple {312#false} assume !false; {312#false} is VALID [2021-09-13 14:28:42,521 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:42,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:42,651 INFO L281 TraceCheckUtils]: 10: Hoare triple {312#false} assume !false; {312#false} is VALID [2021-09-13 14:28:42,651 INFO L281 TraceCheckUtils]: 9: Hoare triple {312#false} assume 0bv32 == __VERIFIER_assert_~cond; {312#false} is VALID [2021-09-13 14:28:42,651 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:28:42,652 INFO L281 TraceCheckUtils]: 7: Hoare triple {357#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv50 32))} assume !~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {312#false} is VALID [2021-09-13 14:28:42,652 INFO L281 TraceCheckUtils]: 6: Hoare triple {361#(bvslt ~counter~0 (_ bv50 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {357#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv50 32))} is VALID [2021-09-13 14:28:42,653 INFO L281 TraceCheckUtils]: 5: Hoare triple {361#(bvslt ~counter~0 (_ bv50 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 (_ bv50 32))} is VALID [2021-09-13 14:28:42,653 INFO L281 TraceCheckUtils]: 4: Hoare triple {361#(bvslt ~counter~0 (_ bv50 32))} assume !(0bv32 == assume_abort_if_not_~cond); {361#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:28:42,654 INFO L281 TraceCheckUtils]: 3: Hoare triple {361#(bvslt ~counter~0 (_ bv50 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 (_ bv50 32))} is VALID [2021-09-13 14:28:42,654 INFO L281 TraceCheckUtils]: 2: Hoare triple {361#(bvslt ~counter~0 (_ bv50 32))} assume !(0bv32 == assume_abort_if_not_~cond); {361#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:28:42,655 INFO L281 TraceCheckUtils]: 1: Hoare triple {361#(bvslt ~counter~0 (_ bv50 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 (_ bv50 32))} is VALID [2021-09-13 14:28:42,656 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 (_ bv50 32))} is VALID [2021-09-13 14:28:42,656 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:42,656 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:28:42,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615786952] [2021-09-13 14:28:42,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615786952] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:42,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:42,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-09-13 14:28:42,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982191491] [2021-09-13 14:28:42,658 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:42,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:42,659 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:28:42,761 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:28:42,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:28:42,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:28:42,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:28:42,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:28:42,762 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:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:55,747 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2021-09-13 14:28:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:28:55,748 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:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:55,748 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:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-09-13 14:28:55,750 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:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-09-13 14:28:55,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2021-09-13 14:28:56,193 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:56,195 INFO L225 Difference]: With dead ends: 48 [2021-09-13 14:28:56,195 INFO L226 Difference]: Without dead ends: 44 [2021-09-13 14:28:56,195 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 85.64ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:28:56,196 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5846.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.19ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5852.10ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:56,197 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 167 Unknown, 0 Unchecked, 4.19ms Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 5852.10ms Time] [2021-09-13 14:28:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-09-13 14:28:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2021-09-13 14:28:56,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:56,204 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:56,204 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:56,204 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:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:56,207 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-09-13 14:28:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-09-13 14:28:56,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:56,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:56,208 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:56,208 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:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:56,210 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-09-13 14:28:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-09-13 14:28:56,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:56,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:56,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:56,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:56,212 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:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 14:28:56,213 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2021-09-13 14:28:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:56,214 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 14:28:56,214 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:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:28:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:28:56,215 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:56,215 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:56,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:56,420 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:56,421 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:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 515746917, now seen corresponding path program 1 times [2021-09-13 14:28:56,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:28:56,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341805461] [2021-09-13 14:28:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:56,423 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:28:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:28:56,427 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:56,429 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:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:56,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:28:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:56,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:56,892 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:56,892 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:56,892 INFO L281 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(0bv32 == assume_abort_if_not_~cond); {572#true} is VALID [2021-09-13 14:28:56,893 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:56,894 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:56,896 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:56,896 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:56,897 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, 50bv32);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:56,898 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:56,898 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:56,898 INFO L281 TraceCheckUtils]: 10: Hoare triple {573#false} assume 0bv32 == __VERIFIER_assert_~cond; {573#false} is VALID [2021-09-13 14:28:56,899 INFO L281 TraceCheckUtils]: 11: Hoare triple {573#false} assume !false; {573#false} is VALID [2021-09-13 14:28:56,899 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:56,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:57,203 INFO L281 TraceCheckUtils]: 11: Hoare triple {573#false} assume !false; {573#false} is VALID [2021-09-13 14:28:57,204 INFO L281 TraceCheckUtils]: 10: Hoare triple {573#false} assume 0bv32 == __VERIFIER_assert_~cond; {573#false} is VALID [2021-09-13 14:28:57,204 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:57,204 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:57,205 INFO L281 TraceCheckUtils]: 7: Hoare triple {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:28:57,205 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:57,206 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:57,207 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:57,207 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:57,207 INFO L281 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(0bv32 == assume_abort_if_not_~cond); {572#true} is VALID [2021-09-13 14:28:57,208 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:57,208 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:57,208 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:57,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:28:57,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341805461] [2021-09-13 14:28:57,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341805461] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:57,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:57,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-09-13 14:28:57,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916519245] [2021-09-13 14:28:57,210 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:57,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:57,210 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:57,314 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:57,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:28:57,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:28:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:28:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:28:57,315 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:29:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:08,883 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-09-13 14:29:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:29:08,884 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:29:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:29:08,884 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:29:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2021-09-13 14:29:08,885 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:29:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2021-09-13 14:29:08,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2021-09-13 14:29:09,254 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:29:09,256 INFO L225 Difference]: With dead ends: 43 [2021-09-13 14:29:09,256 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:29:09,256 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 372.20ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:29:09,257 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4998.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.86ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 5002.73ms IncrementalHoareTripleChecker+Time [2021-09-13 14:29:09,258 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 3.86ms Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 3 Unchecked, 5002.73ms Time] [2021-09-13 14:29:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:29:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:29:09,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:29:09,265 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:29:09,266 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:29:09,266 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:29:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:09,268 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-09-13 14:29:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:29:09,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:09,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:09,269 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:29:09,269 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:29:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:09,270 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-09-13 14:29:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:29:09,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:09,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:09,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:29:09,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:29:09,272 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:29:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-09-13 14:29:09,273 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2021-09-13 14:29:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:29:09,273 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-09-13 14:29:09,274 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:29:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:29:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:29:09,274 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:29:09,275 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:29:09,291 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:29:09,485 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:29:09,485 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:29:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:29:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1270616931, now seen corresponding path program 1 times [2021-09-13 14:29:09,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:29:09,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006167106] [2021-09-13 14:29:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:29:09,487 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:29:09,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:29:09,488 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:29:09,489 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:29:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:09,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:29:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:09,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:29:10,685 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:29:10,686 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:29:10,686 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:29:10,687 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:29:10,688 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:29:10,688 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:29:10,689 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:29:10,690 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, 50bv32);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:29:10,690 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:29:10,691 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:29:10,692 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, 50bv32);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:29:10,692 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:29:10,693 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:29:10,694 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, 50bv32);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:29:10,694 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:29:10,694 INFO L281 TraceCheckUtils]: 15: Hoare triple {829#false} assume !false; {829#false} is VALID [2021-09-13 14:29:10,694 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:29:10,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:29:18,308 INFO L281 TraceCheckUtils]: 15: Hoare triple {829#false} assume !false; {829#false} is VALID [2021-09-13 14:29:18,309 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:29:18,309 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, 50bv32);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:29:18,310 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:29:18,310 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:29:18,311 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, 50bv32);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:29:18,311 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:29:18,312 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:29:18,312 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, 50bv32);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:29:18,312 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:29:18,313 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:29:18,313 INFO L281 TraceCheckUtils]: 4: Hoare triple {828#true} assume !(0bv32 == assume_abort_if_not_~cond); {828#true} is VALID [2021-09-13 14:29:18,314 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:29:18,314 INFO L281 TraceCheckUtils]: 2: Hoare triple {828#true} assume !(0bv32 == assume_abort_if_not_~cond); {828#true} is VALID [2021-09-13 14:29:18,314 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:29:18,314 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:29:18,314 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:29:18,315 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:29:18,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006167106] [2021-09-13 14:29:18,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006167106] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:29:18,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:29:18,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:29:18,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878140589] [2021-09-13 14:29:18,316 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:18,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:29:18,316 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:29:18,746 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:29:18,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:29:18,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:29:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:29:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:29:18,747 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:30:03,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:30:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:13,017 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2021-09-13 14:30:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:30:13,018 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:30:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:30:13,018 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:30:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2021-09-13 14:30:13,020 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:30:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2021-09-13 14:30:13,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2021-09-13 14:30:14,099 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:30:14,101 INFO L225 Difference]: With dead ends: 80 [2021-09-13 14:30:14,101 INFO L226 Difference]: Without dead ends: 78 [2021-09-13 14:30:14,102 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3993.88ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:30:14,103 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23871.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.92ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23876.23ms IncrementalHoareTripleChecker+Time [2021-09-13 14:30:14,103 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 7.92ms Time], IncrementalHoareTripleChecker [27 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 23876.23ms Time] [2021-09-13 14:30:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-09-13 14:30:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2021-09-13 14:30:14,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:30:14,138 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:30:14,138 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:30:14,138 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:30:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:14,141 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-09-13 14:30:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-09-13 14:30:14,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:14,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:14,142 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:30:14,142 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:30:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:14,145 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-09-13 14:30:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-09-13 14:30:14,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:14,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:14,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:30:14,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:30:14,146 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:30:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2021-09-13 14:30:14,148 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2021-09-13 14:30:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:30:14,148 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2021-09-13 14:30:14,148 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:30:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2021-09-13 14:30:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:30:14,149 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:30:14,149 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:30:14,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-09-13 14:30:14,363 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:30:14,364 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:30:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:30:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -648504839, now seen corresponding path program 1 times [2021-09-13 14:30:14,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:30:14,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391323053] [2021-09-13 14:30:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:30:14,366 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:30:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:30:14,367 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:30:14,367 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:30:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:14,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:30:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:14,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:30:14,727 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:30:14,728 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:30:14,728 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:30:14,728 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:30:14,729 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:30:14,729 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:30:14,730 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:30:14,730 INFO L281 TraceCheckUtils]: 7: Hoare triple {1289#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1289#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:30:14,733 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:30:14,733 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:30:14,733 INFO L281 TraceCheckUtils]: 10: Hoare triple {1299#(= (_ bv1 32) |ULTIMATE.start_main_#t~post10|)} assume !~bvslt32(main_#t~post10, 50bv32);havoc main_#t~post10; {1266#false} is VALID [2021-09-13 14:30:14,733 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:30:14,734 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:30:14,734 INFO L281 TraceCheckUtils]: 13: Hoare triple {1266#false} assume !~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1266#false} is VALID [2021-09-13 14:30:14,734 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:30:14,734 INFO L281 TraceCheckUtils]: 15: Hoare triple {1266#false} assume 0bv32 == __VERIFIER_assert_~cond; {1266#false} is VALID [2021-09-13 14:30:14,734 INFO L281 TraceCheckUtils]: 16: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2021-09-13 14:30:14,735 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:30:14,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:30:14,964 INFO L281 TraceCheckUtils]: 16: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2021-09-13 14:30:14,965 INFO L281 TraceCheckUtils]: 15: Hoare triple {1266#false} assume 0bv32 == __VERIFIER_assert_~cond; {1266#false} is VALID [2021-09-13 14:30:14,965 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:30:14,965 INFO L281 TraceCheckUtils]: 13: Hoare triple {1266#false} assume !~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1266#false} is VALID [2021-09-13 14:30:14,965 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:30:14,966 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:30:14,973 INFO L281 TraceCheckUtils]: 10: Hoare triple {1339#(bvslt |ULTIMATE.start_main_#t~post10| (_ bv50 32))} assume !~bvslt32(main_#t~post10, 50bv32);havoc main_#t~post10; {1266#false} is VALID [2021-09-13 14:30:14,974 INFO L281 TraceCheckUtils]: 9: Hoare triple {1343#(bvslt ~counter~0 (_ bv50 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1339#(bvslt |ULTIMATE.start_main_#t~post10| (_ bv50 32))} is VALID [2021-09-13 14:30:14,974 INFO L281 TraceCheckUtils]: 8: Hoare triple {1343#(bvslt ~counter~0 (_ bv50 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 (_ bv50 32))} is VALID [2021-09-13 14:30:14,974 INFO L281 TraceCheckUtils]: 7: Hoare triple {1343#(bvslt ~counter~0 (_ bv50 32))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1343#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:30:14,975 INFO L281 TraceCheckUtils]: 6: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1343#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:30:14,975 INFO L281 TraceCheckUtils]: 5: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 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)) (_ bv50 32))} is VALID [2021-09-13 14:30:14,976 INFO L281 TraceCheckUtils]: 4: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} is VALID [2021-09-13 14:30:14,976 INFO L281 TraceCheckUtils]: 3: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 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)) (_ bv50 32))} is VALID [2021-09-13 14:30:14,977 INFO L281 TraceCheckUtils]: 2: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} is VALID [2021-09-13 14:30:14,977 INFO L281 TraceCheckUtils]: 1: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 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)) (_ bv50 32))} is VALID [2021-09-13 14:30:14,978 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)) (_ bv50 32))} is VALID [2021-09-13 14:30:14,979 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:30:14,979 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:30:14,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391323053] [2021-09-13 14:30:14,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391323053] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:30:14,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:30:14,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-09-13 14:30:14,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743526170] [2021-09-13 14:30:14,980 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:30:14,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:30:14,981 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:30:15,176 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:30:15,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:30:15,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:30:15,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:30:15,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:30:15,178 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:30:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:37,266 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2021-09-13 14:30:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:30:37,266 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:30:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:30:37,266 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:30:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2021-09-13 14:30:37,268 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:30:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2021-09-13 14:30:37,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2021-09-13 14:30:38,297 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:30:38,299 INFO L225 Difference]: With dead ends: 116 [2021-09-13 14:30:38,299 INFO L226 Difference]: Without dead ends: 86 [2021-09-13 14:30:38,300 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 187.99ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:30:38,300 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9871.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.88ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9876.23ms IncrementalHoareTripleChecker+Time [2021-09-13 14:30:38,301 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 3.88ms Time], IncrementalHoareTripleChecker [7 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 9876.23ms Time] [2021-09-13 14:30:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-09-13 14:30:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2021-09-13 14:30:38,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:30:38,351 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:30:38,352 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:30:38,352 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:30:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:38,354 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-09-13 14:30:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2021-09-13 14:30:38,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:38,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:38,356 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:30:38,363 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:30:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:38,366 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-09-13 14:30:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2021-09-13 14:30:38,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:38,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:38,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:30:38,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:30:38,367 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:30:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2021-09-13 14:30:38,369 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 17 [2021-09-13 14:30:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:30:38,369 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2021-09-13 14:30:38,369 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:30:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2021-09-13 14:30:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:30:38,370 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:30:38,370 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:30:38,385 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:30:38,580 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:30:38,583 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:30:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:30:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1354097033, now seen corresponding path program 1 times [2021-09-13 14:30:38,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:30:38,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499391538] [2021-09-13 14:30:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:30:38,584 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:30:38,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:30:38,585 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:30:38,586 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:30:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:38,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:30:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:38,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:30:39,010 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:30:39,011 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:30:39,011 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:30:39,011 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:30:39,012 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:30:39,012 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:30:39,012 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:30:39,013 INFO L281 TraceCheckUtils]: 7: Hoare triple {1816#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1816#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:30:39,013 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:30:39,013 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:30:39,014 INFO L281 TraceCheckUtils]: 10: Hoare triple {1826#(= (_ bv2 32) ~counter~0)} assume !!~bvslt32(main_#t~post10, 50bv32);havoc main_#t~post10; {1826#(= (_ bv2 32) ~counter~0)} is VALID [2021-09-13 14:30:39,014 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:30:39,025 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:30:39,025 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:30:39,026 INFO L281 TraceCheckUtils]: 14: Hoare triple {1839#(= (_ bv2 32) |ULTIMATE.start_main_#t~post9|)} assume !~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1793#false} is VALID [2021-09-13 14:30:39,026 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:30:39,026 INFO L281 TraceCheckUtils]: 16: Hoare triple {1793#false} assume 0bv32 == __VERIFIER_assert_~cond; {1793#false} is VALID [2021-09-13 14:30:39,026 INFO L281 TraceCheckUtils]: 17: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2021-09-13 14:30:39,026 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:30:39,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:30:39,300 INFO L281 TraceCheckUtils]: 17: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2021-09-13 14:30:39,300 INFO L281 TraceCheckUtils]: 16: Hoare triple {1793#false} assume 0bv32 == __VERIFIER_assert_~cond; {1793#false} is VALID [2021-09-13 14:30:39,300 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:30:39,304 INFO L281 TraceCheckUtils]: 14: Hoare triple {1861#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv50 32))} assume !~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1793#false} is VALID [2021-09-13 14:30:39,311 INFO L281 TraceCheckUtils]: 13: Hoare triple {1865#(bvslt ~counter~0 (_ bv50 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1861#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv50 32))} is VALID [2021-09-13 14:30:39,312 INFO L281 TraceCheckUtils]: 12: Hoare triple {1865#(bvslt ~counter~0 (_ bv50 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 (_ bv50 32))} is VALID [2021-09-13 14:30:39,312 INFO L281 TraceCheckUtils]: 11: Hoare triple {1865#(bvslt ~counter~0 (_ bv50 32))} assume !~bvsge64(main_~c~0, main_~b~0); {1865#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:30:39,313 INFO L281 TraceCheckUtils]: 10: Hoare triple {1865#(bvslt ~counter~0 (_ bv50 32))} assume !!~bvslt32(main_#t~post10, 50bv32);havoc main_#t~post10; {1865#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:30:39,313 INFO L281 TraceCheckUtils]: 9: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1865#(bvslt ~counter~0 (_ bv50 32))} is VALID [2021-09-13 14:30:39,313 INFO L281 TraceCheckUtils]: 8: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 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)) (_ bv50 32))} is VALID [2021-09-13 14:30:39,314 INFO L281 TraceCheckUtils]: 7: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} is VALID [2021-09-13 14:30:39,316 INFO L281 TraceCheckUtils]: 6: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv50 32))} is VALID [2021-09-13 14:30:39,316 INFO L281 TraceCheckUtils]: 5: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 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) (_ bv50 32))} is VALID [2021-09-13 14:30:39,316 INFO L281 TraceCheckUtils]: 4: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 32))} is VALID [2021-09-13 14:30:39,317 INFO L281 TraceCheckUtils]: 3: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 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) (_ bv50 32))} is VALID [2021-09-13 14:30:39,317 INFO L281 TraceCheckUtils]: 2: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 32))} is VALID [2021-09-13 14:30:39,317 INFO L281 TraceCheckUtils]: 1: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv50 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) (_ bv50 32))} is VALID [2021-09-13 14:30:39,318 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) (_ bv50 32))} is VALID [2021-09-13 14:30:39,319 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:30:39,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:30:39,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499391538] [2021-09-13 14:30:39,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499391538] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:30:39,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:30:39,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:30:39,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777201019] [2021-09-13 14:30:39,320 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:39,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:30:39,321 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:30:39,581 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:30:39,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:30:39,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:30:39,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:30:39,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:30:39,582 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:30:52,170 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:30:54,230 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:31:06,252 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:31:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:14,159 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2021-09-13 14:31:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:31:14,159 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:31:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:14,160 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:31:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2021-09-13 14:31:14,162 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:31:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2021-09-13 14:31:14,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 143 transitions. [2021-09-13 14:31:15,641 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:31:15,643 INFO L225 Difference]: With dead ends: 156 [2021-09-13 14:31:15,644 INFO L226 Difference]: Without dead ends: 152 [2021-09-13 14:31:15,644 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 355.51ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:31:15,645 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15191.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.56ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15197.64ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:15,645 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 6.56ms Time], IncrementalHoareTripleChecker [20 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 15197.64ms Time] [2021-09-13 14:31:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-09-13 14:31:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 93. [2021-09-13 14:31:15,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:15,715 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:31:15,716 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:31:15,716 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:31:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:15,719 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2021-09-13 14:31:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-09-13 14:31:15,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:15,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:15,721 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:31:15,721 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:31:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:15,724 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2021-09-13 14:31:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-09-13 14:31:15,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:15,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:15,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:15,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:15,726 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:31:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2021-09-13 14:31:15,728 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 18 [2021-09-13 14:31:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:15,728 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2021-09-13 14:31:15,728 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:31:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2021-09-13 14:31:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:31:15,729 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:15,729 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:31:15,746 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:31:15,936 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:31:15,937 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:31:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1292001664, now seen corresponding path program 1 times [2021-09-13 14:31:15,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:31:15,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689949403] [2021-09-13 14:31:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:15,939 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:31:15,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:31:15,940 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:31:15,959 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:31:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:16,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:31:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:16,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:17,071 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:31:17,072 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:31:17,073 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:31:17,073 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:31:17,074 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:31:17,074 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:31:17,075 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:31:17,075 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, 50bv32);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:31:17,076 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:31:17,076 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:31:17,077 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, 50bv32);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:31:17,079 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:31:17,079 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:31:17,080 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, 50bv32);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:31:17,080 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:31:17,081 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:31:17,081 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:31:17,081 INFO L281 TraceCheckUtils]: 17: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2021-09-13 14:31:17,082 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:17,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:27,933 INFO L281 TraceCheckUtils]: 17: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2021-09-13 14:31:27,933 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:31:27,934 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:31:27,934 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:31:27,934 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, 50bv32);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:31:27,935 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:31:27,935 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:31:27,936 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, 50bv32);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:31:27,936 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:31:27,936 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:31:27,937 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, 50bv32);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:31:27,937 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:31:27,937 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:31:27,938 INFO L281 TraceCheckUtils]: 4: Hoare triple {2544#true} assume !(0bv32 == assume_abort_if_not_~cond); {2544#true} is VALID [2021-09-13 14:31:27,938 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:31:27,938 INFO L281 TraceCheckUtils]: 2: Hoare triple {2544#true} assume !(0bv32 == assume_abort_if_not_~cond); {2544#true} is VALID [2021-09-13 14:31:27,938 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:31:27,938 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:31:27,939 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:27,939 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:31:27,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689949403] [2021-09-13 14:31:27,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689949403] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:31:27,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:31:27,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:31:27,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438313530] [2021-09-13 14:31:27,940 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:27,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:27,941 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:31:28,692 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:28,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:31:28,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:31:28,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:31:28,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:31:28,693 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:32:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:17,276 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2021-09-13 14:32:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:32:17,276 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:32:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:17,277 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:32:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2021-09-13 14:32:17,278 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:32:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2021-09-13 14:32:17,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2021-09-13 14:32:18,245 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:32:18,247 INFO L225 Difference]: With dead ends: 126 [2021-09-13 14:32:18,247 INFO L226 Difference]: Without dead ends: 124 [2021-09-13 14:32:18,248 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4976.00ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:32:18,249 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21731.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.77ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21735.95ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:18,250 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 297 Unknown, 0 Unchecked, 4.77ms Time], IncrementalHoareTripleChecker [27 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 21735.95ms Time] [2021-09-13 14:32:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-09-13 14:32:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2021-09-13 14:32:18,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:18,344 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:32:18,344 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:32:18,344 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:32:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:18,347 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2021-09-13 14:32:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-09-13 14:32:18,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:18,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:18,348 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:32:18,348 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:32:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:18,351 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2021-09-13 14:32:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-09-13 14:32:18,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:18,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:18,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:18,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:18,352 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:32:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2021-09-13 14:32:18,354 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 18 [2021-09-13 14:32:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:18,355 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2021-09-13 14:32:18,355 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:32:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2021-09-13 14:32:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:32:18,356 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:18,356 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:32:18,374 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:32:18,569 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:32:18,570 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:32:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 971917338, now seen corresponding path program 1 times [2021-09-13 14:32:18,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:32:18,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298800222] [2021-09-13 14:32:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:18,571 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:32:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:32:18,571 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:32:18,572 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:32:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:18,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:32:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:18,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:19,287 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:32:19,288 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:32:19,288 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:32:19,289 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:32:19,289 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:32:19,290 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:32:19,291 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:32:19,291 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, 50bv32);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:32:19,291 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:32:19,292 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:32:19,292 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, 50bv32);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:32:19,292 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:32:19,293 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:32:19,293 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:32:19,294 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, 50bv32);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:32:19,294 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:32:19,294 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:32:19,295 INFO L281 TraceCheckUtils]: 17: Hoare triple {3206#false} assume 0bv32 == __VERIFIER_assert_~cond; {3206#false} is VALID [2021-09-13 14:32:19,295 INFO L281 TraceCheckUtils]: 18: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2021-09-13 14:32:19,295 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:32:19,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:19,865 INFO L281 TraceCheckUtils]: 18: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2021-09-13 14:32:19,865 INFO L281 TraceCheckUtils]: 17: Hoare triple {3206#false} assume 0bv32 == __VERIFIER_assert_~cond; {3206#false} is VALID [2021-09-13 14:32:19,865 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:32:19,866 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:32:19,866 INFO L281 TraceCheckUtils]: 14: Hoare triple {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:32:19,866 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:32:19,867 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:32:19,867 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:32:19,868 INFO L281 TraceCheckUtils]: 10: Hoare triple {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !!~bvslt32(main_#t~post10, 50bv32);havoc main_#t~post10; {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:32:19,868 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:32:19,869 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:32:19,869 INFO L281 TraceCheckUtils]: 7: Hoare triple {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:32:19,870 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:32:19,870 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:32:19,871 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:32:19,871 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:32:19,872 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:32:19,872 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:32:19,873 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:32:19,873 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:32:19,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:32:19,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298800222] [2021-09-13 14:32:19,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298800222] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:32:19,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:32:19,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-09-13 14:32:19,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801624962] [2021-09-13 14:32:19,874 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:32:19,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:19,874 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:32:20,131 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:32:20,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:32:20,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:32:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:32:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:32:20,132 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:32:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:31,844 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2021-09-13 14:32:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:32:31,845 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:32:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:31,845 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:32:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2021-09-13 14:32:31,846 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:32:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2021-09-13 14:32:31,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2021-09-13 14:32:32,317 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:32:32,318 INFO L225 Difference]: With dead ends: 97 [2021-09-13 14:32:32,318 INFO L226 Difference]: Without dead ends: 93 [2021-09-13 14:32:32,319 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 623.37ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:32:32,319 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4766.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 4768.65ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:32,320 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 44 Unchecked, 4768.65ms Time] [2021-09-13 14:32:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-13 14:32:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-09-13 14:32:32,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:32,408 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:32:32,408 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:32:32,409 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:32:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:32,411 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2021-09-13 14:32:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:32:32,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:32,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:32,411 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:32:32,412 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:32:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:32,414 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2021-09-13 14:32:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:32:32,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:32,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:32,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:32,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:32,415 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:32:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2021-09-13 14:32:32,417 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 19 [2021-09-13 14:32:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:32,417 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2021-09-13 14:32:32,418 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:32:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:32:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:32:32,418 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:32,418 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:32:32,451 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:32:32,632 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:32:32,633 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:32:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash -367893245, now seen corresponding path program 1 times [2021-09-13 14:32:32,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:32:32,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200577409] [2021-09-13 14:32:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:32,634 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:32:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:32:32,635 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:32:32,635 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:32:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:32,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:32:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:32,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:33,900 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:32:33,901 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:32:33,902 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:32:33,903 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:32:33,903 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:32:33,905 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:32:33,906 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:32:33,906 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, 50bv32);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:32:33,907 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:32:33,908 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:32:33,908 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, 50bv32);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:32:33,909 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:32:33,909 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:32:33,910 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, 50bv32);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:32:33,911 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:32:33,912 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:32:33,912 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:32:33,913 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:32:33,913 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:32:33,913 INFO L281 TraceCheckUtils]: 19: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2021-09-13 14:32:33,914 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:33,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:36,967 INFO L281 TraceCheckUtils]: 19: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2021-09-13 14:32:36,968 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:32:36,968 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:32:36,968 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:32:36,969 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:32:36,969 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:32:36,969 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, 50bv32);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:32:36,969 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:32:36,970 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:32:36,970 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, 50bv32);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:32:36,971 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:32:36,971 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:32:36,972 INFO L281 TraceCheckUtils]: 7: Hoare triple {3767#true} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {3767#true} is VALID [2021-09-13 14:32:36,972 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:32:36,972 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:32:36,972 INFO L281 TraceCheckUtils]: 4: Hoare triple {3767#true} assume !(0bv32 == assume_abort_if_not_~cond); {3767#true} is VALID [2021-09-13 14:32:36,972 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:32:36,973 INFO L281 TraceCheckUtils]: 2: Hoare triple {3767#true} assume !(0bv32 == assume_abort_if_not_~cond); {3767#true} is VALID [2021-09-13 14:32:36,973 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:32:36,973 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:32:36,973 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:36,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:32:36,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200577409] [2021-09-13 14:32:36,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200577409] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:32:36,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:32:36,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 4] imperfect sequences [] total 11 [2021-09-13 14:32:36,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718688287] [2021-09-13 14:32:36,975 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:36,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:36,976 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:32:37,486 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:32:37,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:32:37,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:32:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:32:37,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:32:37,487 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:33:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:07,821 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2021-09-13 14:33:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:33:07,823 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:33:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:33:07,823 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:33:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2021-09-13 14:33:07,824 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:33:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2021-09-13 14:33:07,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 81 transitions. [2021-09-13 14:33:08,871 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:33:08,873 INFO L225 Difference]: With dead ends: 120 [2021-09-13 14:33:08,873 INFO L226 Difference]: Without dead ends: 118 [2021-09-13 14:33:08,874 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2014.81ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:33:08,874 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11745.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.54ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 11748.38ms IncrementalHoareTripleChecker+Time [2021-09-13 14:33:08,874 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 2.54ms Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 45 Unchecked, 11748.38ms Time] [2021-09-13 14:33:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-09-13 14:33:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2021-09-13 14:33:08,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:33:08,972 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:33:08,973 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:33:08,973 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:33:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:08,975 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-09-13 14:33:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2021-09-13 14:33:08,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:08,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:08,976 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:33:08,977 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:33:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:08,978 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-09-13 14:33:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2021-09-13 14:33:08,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:08,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:08,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:33:08,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:33:08,980 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:33:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2021-09-13 14:33:08,981 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 20 [2021-09-13 14:33:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:33:08,982 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2021-09-13 14:33:08,982 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:33:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2021-09-13 14:33:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:33:08,982 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:33:08,983 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:33:09,014 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:33:09,197 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:33:09,200 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:33:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:33:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1357932506, now seen corresponding path program 1 times [2021-09-13 14:33:09,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:33:09,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693882848] [2021-09-13 14:33:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:33:09,201 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:33:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:33:09,202 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:33:09,205 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:33:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:09,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:33:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:09,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:33:10,276 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:33:10,276 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:33:10,276 INFO L281 TraceCheckUtils]: 2: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:33:10,277 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:33:10,277 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:33:10,278 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:33:10,279 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:33:10,279 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, 50bv32);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:33:10,279 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:33:10,280 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:33:10,280 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, 50bv32);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:33:10,280 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:33:10,281 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:33:10,281 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, 50bv32);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:33:10,282 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:33:10,282 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:33:10,283 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:33:10,283 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:33:10,284 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:33:10,284 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:33:10,285 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:33:10,285 INFO L281 TraceCheckUtils]: 21: Hoare triple {4434#false} assume !false; {4434#false} is VALID [2021-09-13 14:33:10,285 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:33:10,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:33:12,529 INFO L281 TraceCheckUtils]: 21: Hoare triple {4434#false} assume !false; {4434#false} is VALID [2021-09-13 14:33:12,529 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:33:12,530 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:33:12,530 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:33:12,531 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:33:12,531 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:33:12,531 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:33:12,532 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:33:12,532 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, 50bv32);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:33:12,532 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:33:12,533 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:33:12,533 INFO L281 TraceCheckUtils]: 10: Hoare triple {4433#true} assume !!~bvslt32(main_#t~post10, 50bv32);havoc main_#t~post10; {4433#true} is VALID [2021-09-13 14:33:12,534 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:33:12,534 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:33:12,534 INFO L281 TraceCheckUtils]: 7: Hoare triple {4433#true} assume !!~bvslt32(main_#t~post9, 50bv32);havoc main_#t~post9; {4433#true} is VALID [2021-09-13 14:33:12,534 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:33:12,534 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:33:12,534 INFO L281 TraceCheckUtils]: 4: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:33:12,534 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:33:12,534 INFO L281 TraceCheckUtils]: 2: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:33:12,534 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:33:12,535 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:33:12,535 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:33:12,535 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:33:12,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693882848] [2021-09-13 14:33:12,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693882848] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:33:12,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:33:12,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2021-09-13 14:33:12,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030871580] [2021-09-13 14:33:12,536 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:33:12,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:33:12,536 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:33:13,009 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:33:13,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:33:13,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:33:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:33:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:33:13,011 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:33:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:32,212 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2021-09-13 14:33:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:33:32,213 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:33:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:33:32,213 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:33:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2021-09-13 14:33:32,213 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:33:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2021-09-13 14:33:32,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 86 transitions. [2021-09-13 14:33:33,247 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:33:33,249 INFO L225 Difference]: With dead ends: 137 [2021-09-13 14:33:33,249 INFO L226 Difference]: Without dead ends: 135 [2021-09-13 14:33:33,249 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1218.25ms TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:33:33,250 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8212.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.87ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 8214.97ms IncrementalHoareTripleChecker+Time [2021-09-13 14:33:33,250 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 1.87ms Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 63 Unchecked, 8214.97ms Time] [2021-09-13 14:33:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-09-13 14:33:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2021-09-13 14:33:33,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:33:33,371 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:33:33,371 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:33:33,371 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:33:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:33,373 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2021-09-13 14:33:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2021-09-13 14:33:33,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:33,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:33,374 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:33:33,375 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:33:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:33:33,377 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2021-09-13 14:33:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2021-09-13 14:33:33,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:33:33,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:33:33,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:33:33,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:33:33,378 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:33:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2021-09-13 14:33:33,380 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 22 [2021-09-13 14:33:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:33:33,380 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2021-09-13 14:33:33,380 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:33:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2021-09-13 14:33:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:33:33,381 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:33:33,381 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:33:33,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-09-13 14:33:33,589 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:33:33,589 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:33:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:33:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1235592658, now seen corresponding path program 1 times [2021-09-13 14:33:33,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:33:33,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389203189] [2021-09-13 14:33:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:33:33,590 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:33:33,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:33:33,604 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:33:33,605 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:33:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:33,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:33:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:33:33,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:33:35,036 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:35,038 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:33:35,039 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:33:35,039 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:33:35,040 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:33:35,040 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:33:35,041 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:33:35,041 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, 50bv32);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:33:35,042 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:33:35,042 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:33:35,042 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, 50bv32);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:33:35,043 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:33:35,043 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:33:35,044 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:33:35,044 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, 50bv32);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:33:35,045 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:33:35,045 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:33:35,049 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, 50bv32);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:33:35,049 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:33:35,050 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:33:35,050 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, 50bv32);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:33:35,051 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:33:35,051 INFO L281 TraceCheckUtils]: 22: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2021-09-13 14:33:35,051 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:35,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:33:47,602 INFO L281 TraceCheckUtils]: 22: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2021-09-13 14:33:47,602 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:47,603 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, 50bv32);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:47,603 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:47,603 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:47,604 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, 50bv32);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:47,604 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:47,604 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:47,604 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, 50bv32);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:47,605 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:47,605 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:47,605 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:47,606 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, 50bv32);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:47,606 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:47,606 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:47,607 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, 50bv32);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:47,607 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:47,607 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:47,608 INFO L281 TraceCheckUtils]: 4: Hoare triple {5190#true} assume !(0bv32 == assume_abort_if_not_~cond); {5190#true} is VALID [2021-09-13 14:33:47,608 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:47,608 INFO L281 TraceCheckUtils]: 2: Hoare triple {5190#true} assume !(0bv32 == assume_abort_if_not_~cond); {5190#true} is VALID [2021-09-13 14:33:47,608 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:47,608 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:47,609 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:47,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:33:47,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389203189] [2021-09-13 14:33:47,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389203189] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:33:47,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:33:47,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-09-13 14:33:47,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492171192] [2021-09-13 14:33:47,610 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:47,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:33:47,610 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:48,524 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:48,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:33:48,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:33:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:33:48,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:33:48,525 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:34:20,876 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:34:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:34:20,908 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 13195.61ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:34:20,909 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12906.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.31ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12907.83ms IncrementalHoareTripleChecker+Time [2021-09-13 14:34:20,909 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 1.31ms Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 12907.83ms Time] [2021-09-13 14:34:20,924 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:34:21,109 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:34:21,110 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@1b56bc41 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:34:21,114 INFO L158 Benchmark]: Toolchain (without parser) took 347562.56ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.5MB in the beginning and 31.1MB in the end (delta: 6.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2021-09-13 14:34:21,114 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:34:21,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.67ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 41.4MB in the end (delta: -4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:34:21,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.09ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 39.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:34:21,114 INFO L158 Benchmark]: Boogie Preprocessor took 24.15ms. Allocated memory is still 58.7MB. Free memory was 39.2MB in the beginning and 37.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:34:21,115 INFO L158 Benchmark]: RCFGBuilder took 4144.56ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.7MB in the beginning and 53.7MB in the end (delta: -15.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-09-13 14:34:21,115 INFO L158 Benchmark]: TraceAbstraction took 343090.46ms. Allocated memory is still 71.3MB. Free memory was 53.1MB in the beginning and 31.1MB in the end (delta: 22.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2021-09-13 14:34:21,116 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.20ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.67ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 41.4MB in the end (delta: -4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.09ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 39.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.15ms. Allocated memory is still 58.7MB. Free memory was 39.2MB in the beginning and 37.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 4144.56ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.7MB in the beginning and 53.7MB in the end (delta: -15.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 343090.46ms. Allocated memory is still 71.3MB. Free memory was 53.1MB in the beginning and 31.1MB in the end (delta: 22.0MB). Peak memory consumption was 22.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@1b56bc41 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@1b56bc41: 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:34:21,183 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...