./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.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_unwindbound100.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 2c276e2f4567029b3fa5de9c90b3a06c874f34cf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_unwindbound100.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 2c276e2f4567029b3fa5de9c90b3a06c874f34cf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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@33953e69 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:20:06,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:20:06,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:20:06,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:20:06,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:20:06,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:20:06,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:20:06,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:20:06,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:20:06,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:20:06,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:20:06,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:20:06,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:20:06,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:20:06,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:20:06,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:20:06,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:20:06,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:20:06,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:20:06,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:20:06,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:20:06,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:20:06,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:20:06,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:20:06,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:20:06,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:20:06,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:20:06,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:20:06,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:20:06,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:20:06,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:20:06,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:20:06,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:20:06,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:20:06,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:20:06,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:20:06,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:20:06,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:20:06,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:20:06,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:20:06,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:20:06,694 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:20:06,722 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:20:06,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:20:06,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:20:06,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:20:06,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:20:06,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:20:06,724 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:20:06,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:20:06,725 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:20:06,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:20:06,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:20:06,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:20:06,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:20:06,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:20:06,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:20:06,726 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:20:06,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:20:06,727 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:20:06,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:20:06,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:20:06,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:20:06,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:20:06,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:20:06,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:20:06,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:20:06,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:20:06,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:20:06,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:20:06,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:20:06,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:20:06,729 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 -> 2c276e2f4567029b3fa5de9c90b3a06c874f34cf [2021-09-13 14:20:06,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:20:06,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:20:06,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:20:06,990 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:20:06,990 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:20:06,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2021-09-13 14:20:07,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42da66b0e/9e097738070b4e2f81bb3daad56ac38a/FLAG2cab15534 [2021-09-13 14:20:07,322 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:20:07,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2021-09-13 14:20:07,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42da66b0e/9e097738070b4e2f81bb3daad56ac38a/FLAG2cab15534 [2021-09-13 14:20:07,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42da66b0e/9e097738070b4e2f81bb3daad56ac38a [2021-09-13 14:20:07,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:20:07,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:20:07,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:20:07,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:20:07,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:20:07,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:07,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413545e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07, skipping insertion in model container [2021-09-13 14:20:07,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:07,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:20:07,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:20:07,897 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_unwindbound100.c[490,503] [2021-09-13 14:20:07,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:20:07,927 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:20:07,934 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_unwindbound100.c[490,503] [2021-09-13 14:20:07,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:20:07,949 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:20:07,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07 WrapperNode [2021-09-13 14:20:07,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:20:07,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:20:07,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:20:07,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:20:07,954 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:20:07" (1/1) ... [2021-09-13 14:20:07,958 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:20:07" (1/1) ... [2021-09-13 14:20:08,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:20:08,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:20:08,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:20:08,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:20:08,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:20:08,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:20:08,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:20:08,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:20:08,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (1/1) ... [2021-09-13 14:20:08,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:20:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:08,118 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:20:08,124 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:20:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:20:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:20:08,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:20:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:20:08,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:20:08,363 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-09-13 14:20:08,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:20:08 BoogieIcfgContainer [2021-09-13 14:20:08,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:20:08,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:20:08,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:20:08,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:20:08,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:20:07" (1/3) ... [2021-09-13 14:20:08,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e82ada7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:20:08, skipping insertion in model container [2021-09-13 14:20:08,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:20:07" (2/3) ... [2021-09-13 14:20:08,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e82ada7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:20:08, skipping insertion in model container [2021-09-13 14:20:08,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:20:08" (3/3) ... [2021-09-13 14:20:08,383 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.c [2021-09-13 14:20:08,386 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:20:08,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:20:08,428 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:20:08,444 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:20:08,460 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:20:08,471 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:20:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:20:08,473 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:08,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:20:08,474 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:20:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1233339761, now seen corresponding path program 1 times [2021-09-13 14:20:08,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:08,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092970119] [2021-09-13 14:20:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:08,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:08,693 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:20:08,693 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:20:08,694 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:20:08,694 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:20:08,694 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:20:08,694 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:20:08,695 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:20:08,695 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:20:08,695 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:20:08,695 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:20:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:20:08,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:08,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092970119] [2021-09-13 14:20:08,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092970119] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:08,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:08,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:20:08,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077475277] [2021-09-13 14:20:08,716 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:20:08,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:08,718 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:20:08,729 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:20:08,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:20:08,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:20:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:20:08,760 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:20:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:08,915 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-09-13 14:20:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:20:08,916 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:20:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:08,917 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:20:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:20:08,923 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:20:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:20:08,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2021-09-13 14:20:09,022 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:20:09,028 INFO L225 Difference]: With dead ends: 77 [2021-09-13 14:20:09,028 INFO L226 Difference]: Without dead ends: 36 [2021-09-13 14:20:09,030 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:20:09,032 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.49ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.97ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:09,033 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.49ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 65.97ms Time] [2021-09-13 14:20:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-13 14:20:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-13 14:20:09,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:09,053 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:20:09,054 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:20:09,054 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:20:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:09,056 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:20:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:20:09,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:09,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:09,057 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:20:09,058 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:20:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:09,060 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:20:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:20:09,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:09,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:09,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:09,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:09,061 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:20:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-09-13 14:20:09,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2021-09-13 14:20:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:09,064 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-09-13 14:20:09,064 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:20:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:20:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:20:09,065 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:09,065 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:20:09,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:20:09,065 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:20:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1507359540, now seen corresponding path program 1 times [2021-09-13 14:20:09,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:09,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988257917] [2021-09-13 14:20:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:09,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:09,079 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:09,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396272539] [2021-09-13 14:20:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:09,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:09,120 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:20:09,149 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:20:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:09,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:20:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:09,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:09,301 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:20:09,302 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:20:09,302 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:20:09,303 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:20:09,303 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:20:09,304 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:20:09,304 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:20:09,305 INFO L281 TraceCheckUtils]: 7: Hoare triple {281#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {258#false} is VALID [2021-09-13 14:20:09,305 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:20:09,305 INFO L281 TraceCheckUtils]: 9: Hoare triple {258#false} assume 0 == __VERIFIER_assert_~cond; {258#false} is VALID [2021-09-13 14:20:09,305 INFO L281 TraceCheckUtils]: 10: Hoare triple {258#false} assume !false; {258#false} is VALID [2021-09-13 14:20:09,306 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:20:09,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:09,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:09,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988257917] [2021-09-13 14:20:09,307 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:09,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396272539] [2021-09-13 14:20:09,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396272539] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:09,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:09,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:20:09,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165125446] [2021-09-13 14:20:09,308 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:20:09,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:09,309 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:20:09,317 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:20:09,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:20:09,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:20:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:20:09,318 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:20:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:09,456 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-09-13 14:20:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:20:09,457 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:20:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:09,457 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:20:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-09-13 14:20:09,459 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:20:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-09-13 14:20:09,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2021-09-13 14:20:09,490 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:20:09,491 INFO L225 Difference]: With dead ends: 42 [2021-09-13 14:20:09,491 INFO L226 Difference]: Without dead ends: 38 [2021-09-13 14:20:09,492 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.97ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:20:09,493 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.69ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:09,493 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 68.69ms Time] [2021-09-13 14:20:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-09-13 14:20:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-09-13 14:20:09,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:09,498 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:20:09,498 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:20:09,499 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:20:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:09,500 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 14:20:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:20:09,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:09,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:09,501 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:20:09,501 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:20:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:09,503 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 14:20:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:20:09,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:09,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:09,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:09,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:09,504 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:20:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 14:20:09,505 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2021-09-13 14:20:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:09,505 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 14:20:09,506 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:20:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:20:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:20:09,506 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:09,506 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:20:09,534 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:20:09,723 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:20:09,723 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:20:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 515746917, now seen corresponding path program 1 times [2021-09-13 14:20:09,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:09,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509959651] [2021-09-13 14:20:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:09,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:09,734 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:09,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171979723] [2021-09-13 14:20:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:09,735 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:09,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:09,742 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:20:09,756 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:20:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:09,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:20:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:09,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:09,902 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:20:09,903 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:20:09,903 INFO L281 TraceCheckUtils]: 2: Hoare triple {465#true} assume !(0 == assume_abort_if_not_~cond); {465#true} is VALID [2021-09-13 14:20:09,903 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:20:09,904 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:20:09,904 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:20:09,905 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:20:09,905 INFO L281 TraceCheckUtils]: 7: Hoare triple {487#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {487#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:20:09,906 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:20:09,906 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:20:09,906 INFO L281 TraceCheckUtils]: 10: Hoare triple {466#false} assume 0 == __VERIFIER_assert_~cond; {466#false} is VALID [2021-09-13 14:20:09,906 INFO L281 TraceCheckUtils]: 11: Hoare triple {466#false} assume !false; {466#false} is VALID [2021-09-13 14:20:09,906 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:20:09,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:09,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:09,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509959651] [2021-09-13 14:20:09,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:09,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171979723] [2021-09-13 14:20:09,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171979723] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:09,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:09,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:20:09,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521119099] [2021-09-13 14:20:09,908 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:20:09,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:09,908 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:20:09,916 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:20:09,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:20:09,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:09,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:20:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:20:09,917 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:20:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:10,125 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2021-09-13 14:20:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:20:10,125 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:20:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:10,125 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:20:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-09-13 14:20:10,127 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:20:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-09-13 14:20:10,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2021-09-13 14:20:10,192 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:20:10,193 INFO L225 Difference]: With dead ends: 66 [2021-09-13 14:20:10,193 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:20:10,194 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.28ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:20:10,195 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.27ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.68ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:10,195 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 2.27ms Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 56.68ms Time] [2021-09-13 14:20:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:20:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 39. [2021-09-13 14:20:10,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:10,209 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:20:10,209 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:20:10,209 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:20:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:10,211 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:20:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-09-13 14:20:10,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:10,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:10,212 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:20:10,212 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:20:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:10,214 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:20:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-09-13 14:20:10,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:10,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:10,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:10,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:10,215 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:20:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-09-13 14:20:10,216 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2021-09-13 14:20:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:10,216 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-09-13 14:20:10,216 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:20:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:20:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:20:10,217 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:10,217 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:20:10,252 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:20:10,433 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:20:10,433 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:20:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1270616931, now seen corresponding path program 1 times [2021-09-13 14:20:10,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:10,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125345655] [2021-09-13 14:20:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:10,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:10,445 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:10,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304496289] [2021-09-13 14:20:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:10,446 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:10,474 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:20:10,475 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:20:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:10,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:20:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:10,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:10,790 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:20:10,791 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:20:10,791 INFO L281 TraceCheckUtils]: 2: Hoare triple {760#true} assume !(0 == assume_abort_if_not_~cond); {760#true} is VALID [2021-09-13 14:20:10,791 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:20:10,792 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:20:10,792 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:20:10,793 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:20:10,793 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 < 100);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:20:10,794 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:20:10,794 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:20:10,795 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 < 100);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:20:10,795 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:20:10,796 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:20:10,796 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 < 100);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:20:10,797 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:20:10,797 INFO L281 TraceCheckUtils]: 15: Hoare triple {761#false} assume !false; {761#false} is VALID [2021-09-13 14:20:10,797 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:20:10,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:10,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:10,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125345655] [2021-09-13 14:20:10,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:10,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304496289] [2021-09-13 14:20:10,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304496289] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:10,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:10,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:20:10,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439374737] [2021-09-13 14:20:10,799 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:20:10,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:10,799 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:20:10,810 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:20:10,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:20:10,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:20:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:20:10,811 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:20:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:11,102 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:20:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:20:11,103 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:20:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:11,103 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:20:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2021-09-13 14:20:11,104 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:20:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2021-09-13 14:20:11,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2021-09-13 14:20:11,151 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:20:11,152 INFO L225 Difference]: With dead ends: 62 [2021-09-13 14:20:11,152 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:20:11,153 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 88.09ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:20:11,153 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.47ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.99ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:11,153 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 1.47ms Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 79.99ms Time] [2021-09-13 14:20:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:20:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2021-09-13 14:20:11,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:11,181 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:20:11,182 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:20:11,182 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:20:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:11,183 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-09-13 14:20:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-09-13 14:20:11,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:11,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:11,184 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:20:11,184 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:20:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:11,186 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-09-13 14:20:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-09-13 14:20:11,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:11,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:11,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:11,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:11,187 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:20:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2021-09-13 14:20:11,188 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2021-09-13 14:20:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:11,188 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2021-09-13 14:20:11,188 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:20:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2021-09-13 14:20:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:20:11,189 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:11,189 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:20:11,222 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:20:11,425 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:20:11,426 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:20:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:11,426 INFO L82 PathProgramCache]: Analyzing trace with hash -648504839, now seen corresponding path program 1 times [2021-09-13 14:20:11,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:11,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602335372] [2021-09-13 14:20:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:11,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:11,436 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:11,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707956392] [2021-09-13 14:20:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:11,437 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:11,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:11,437 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:20:11,438 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:20:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:11,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:20:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:11,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:11,579 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:20:11,580 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:20:11,580 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:20:11,581 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:20:11,581 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:20:11,581 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:20:11,582 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:20:11,582 INFO L281 TraceCheckUtils]: 7: Hoare triple {1106#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {1106#(<= ~counter~0 1)} is VALID [2021-09-13 14:20:11,583 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:20:11,583 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:20:11,584 INFO L281 TraceCheckUtils]: 10: Hoare triple {1116#(<= |ULTIMATE.start_main_#t~post10| 1)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {1083#false} is VALID [2021-09-13 14:20:11,584 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:20:11,584 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:20:11,584 INFO L281 TraceCheckUtils]: 13: Hoare triple {1083#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {1083#false} is VALID [2021-09-13 14:20:11,584 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:20:11,585 INFO L281 TraceCheckUtils]: 15: Hoare triple {1083#false} assume 0 == __VERIFIER_assert_~cond; {1083#false} is VALID [2021-09-13 14:20:11,585 INFO L281 TraceCheckUtils]: 16: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2021-09-13 14:20:11,585 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:20:11,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:11,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:11,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602335372] [2021-09-13 14:20:11,585 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:11,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707956392] [2021-09-13 14:20:11,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707956392] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:11,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:11,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:20:11,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771387756] [2021-09-13 14:20:11,586 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:20:11,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:11,587 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:20:11,604 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:20:11,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:20:11,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:20:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:20:11,605 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:20:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:11,756 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2021-09-13 14:20:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:20:11,756 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:20:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:11,757 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:20:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-09-13 14:20:11,757 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:20:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-09-13 14:20:11,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2021-09-13 14:20:11,805 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:20:11,806 INFO L225 Difference]: With dead ends: 85 [2021-09-13 14:20:11,806 INFO L226 Difference]: Without dead ends: 55 [2021-09-13 14:20:11,806 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.67ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:20:11,806 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.99ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:11,807 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 61.99ms Time] [2021-09-13 14:20:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-09-13 14:20:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-09-13 14:20:11,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:11,837 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:20:11,837 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:20:11,837 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:20:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:11,838 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-09-13 14:20:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:20:11,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:11,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:11,839 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:20:11,839 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:20:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:11,840 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-09-13 14:20:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:20:11,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:11,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:11,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:11,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:11,841 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:20:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2021-09-13 14:20:11,843 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 17 [2021-09-13 14:20:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:11,843 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-09-13 14:20:11,843 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:20:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:20:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:20:11,843 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:11,844 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:20:11,860 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:20:12,060 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:20:12,060 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:20:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1354097033, now seen corresponding path program 1 times [2021-09-13 14:20:12,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:12,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944514102] [2021-09-13 14:20:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:12,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:12,084 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:12,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017860245] [2021-09-13 14:20:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:12,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:12,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:12,086 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:20:12,086 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:20:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:12,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:20:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:12,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:12,261 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:20:12,261 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:20:12,262 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:20:12,262 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:20:12,263 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:20:12,263 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:20:12,264 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:20:12,264 INFO L281 TraceCheckUtils]: 7: Hoare triple {1448#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {1448#(<= ~counter~0 1)} is VALID [2021-09-13 14:20:12,264 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:20:12,265 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:20:12,265 INFO L281 TraceCheckUtils]: 10: Hoare triple {1458#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {1458#(<= ~counter~0 2)} is VALID [2021-09-13 14:20:12,266 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:20:12,266 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:20:12,267 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:20:12,267 INFO L281 TraceCheckUtils]: 14: Hoare triple {1471#(<= |ULTIMATE.start_main_#t~post9| 2)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {1425#false} is VALID [2021-09-13 14:20:12,267 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:20:12,268 INFO L281 TraceCheckUtils]: 16: Hoare triple {1425#false} assume 0 == __VERIFIER_assert_~cond; {1425#false} is VALID [2021-09-13 14:20:12,268 INFO L281 TraceCheckUtils]: 17: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2021-09-13 14:20:12,268 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:20:12,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:12,414 INFO L281 TraceCheckUtils]: 17: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2021-09-13 14:20:12,414 INFO L281 TraceCheckUtils]: 16: Hoare triple {1425#false} assume 0 == __VERIFIER_assert_~cond; {1425#false} is VALID [2021-09-13 14:20:12,414 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:20:12,415 INFO L281 TraceCheckUtils]: 14: Hoare triple {1493#(< |ULTIMATE.start_main_#t~post9| 100)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {1425#false} is VALID [2021-09-13 14:20:12,415 INFO L281 TraceCheckUtils]: 13: Hoare triple {1497#(< ~counter~0 100)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1493#(< |ULTIMATE.start_main_#t~post9| 100)} is VALID [2021-09-13 14:20:12,415 INFO L281 TraceCheckUtils]: 12: Hoare triple {1497#(< ~counter~0 100)} 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 100)} is VALID [2021-09-13 14:20:12,416 INFO L281 TraceCheckUtils]: 11: Hoare triple {1497#(< ~counter~0 100)} assume !(main_~c~0 >= main_~b~0); {1497#(< ~counter~0 100)} is VALID [2021-09-13 14:20:12,416 INFO L281 TraceCheckUtils]: 10: Hoare triple {1497#(< ~counter~0 100)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {1497#(< ~counter~0 100)} is VALID [2021-09-13 14:20:12,417 INFO L281 TraceCheckUtils]: 9: Hoare triple {1510#(< ~counter~0 99)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1497#(< ~counter~0 100)} is VALID [2021-09-13 14:20:12,417 INFO L281 TraceCheckUtils]: 8: Hoare triple {1510#(< ~counter~0 99)} 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 99)} is VALID [2021-09-13 14:20:12,417 INFO L281 TraceCheckUtils]: 7: Hoare triple {1510#(< ~counter~0 99)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {1510#(< ~counter~0 99)} is VALID [2021-09-13 14:20:12,418 INFO L281 TraceCheckUtils]: 6: Hoare triple {1520#(< ~counter~0 98)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1510#(< ~counter~0 99)} is VALID [2021-09-13 14:20:12,418 INFO L281 TraceCheckUtils]: 5: Hoare triple {1520#(< ~counter~0 98)} 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 98)} is VALID [2021-09-13 14:20:12,419 INFO L281 TraceCheckUtils]: 4: Hoare triple {1520#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {1520#(< ~counter~0 98)} is VALID [2021-09-13 14:20:12,419 INFO L281 TraceCheckUtils]: 3: Hoare triple {1520#(< ~counter~0 98)} 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 98)} is VALID [2021-09-13 14:20:12,419 INFO L281 TraceCheckUtils]: 2: Hoare triple {1520#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {1520#(< ~counter~0 98)} is VALID [2021-09-13 14:20:12,420 INFO L281 TraceCheckUtils]: 1: Hoare triple {1520#(< ~counter~0 98)} 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 98)} is VALID [2021-09-13 14:20:12,420 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 98)} is VALID [2021-09-13 14:20:12,421 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:20:12,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:12,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944514102] [2021-09-13 14:20:12,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:12,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017860245] [2021-09-13 14:20:12,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017860245] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:12,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:12,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:20:12,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276198236] [2021-09-13 14:20:12,422 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:20:12,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:12,422 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:20:12,445 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:20:12,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:20:12,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:12,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:20:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:20:12,446 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:20:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:12,903 INFO L93 Difference]: Finished difference Result 156 states and 188 transitions. [2021-09-13 14:20:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:20:12,903 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:20:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:12,903 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:20:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2021-09-13 14:20:12,905 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:20:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2021-09-13 14:20:12,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 144 transitions. [2021-09-13 14:20:12,999 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:20:13,001 INFO L225 Difference]: With dead ends: 156 [2021-09-13 14:20:13,001 INFO L226 Difference]: Without dead ends: 152 [2021-09-13 14:20:13,002 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 53.94ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:20:13,002 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 169.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.76ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:13,002 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 170.76ms Time] [2021-09-13 14:20:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-09-13 14:20:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2021-09-13 14:20:13,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:13,074 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:20:13,074 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:20:13,075 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:20:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:13,077 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-09-13 14:20:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-09-13 14:20:13,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:13,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:13,078 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:20:13,078 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:20:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:13,081 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-09-13 14:20:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-09-13 14:20:13,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:13,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:13,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:13,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:13,082 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:20:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2021-09-13 14:20:13,084 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 18 [2021-09-13 14:20:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:13,084 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2021-09-13 14:20:13,084 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:20:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2021-09-13 14:20:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:20:13,085 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:13,085 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:20:13,103 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:20:13,301 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:20:13,301 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:20:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1292001664, now seen corresponding path program 1 times [2021-09-13 14:20:13,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:13,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103154102] [2021-09-13 14:20:13,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:13,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:13,312 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:13,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153054385] [2021-09-13 14:20:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:13,313 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:13,333 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:20:13,369 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:20:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:13,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-09-13 14:20:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:13,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:13,855 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:20:13,855 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:20:13,855 INFO L281 TraceCheckUtils]: 2: Hoare triple {2168#true} assume !(0 == assume_abort_if_not_~cond); {2168#true} is VALID [2021-09-13 14:20:13,856 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:20:13,856 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:20:13,857 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:20:13,857 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:20:13,858 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 < 100);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:20:13,858 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:20:13,859 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:20:13,859 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 < 100);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:20:13,860 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:20:13,860 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:20:13,861 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 < 100);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:20:13,861 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:20:13,862 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:20:13,862 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:20:13,862 INFO L281 TraceCheckUtils]: 17: Hoare triple {2169#false} assume !false; {2169#false} is VALID [2021-09-13 14:20:13,863 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:20:13,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:13,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:13,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103154102] [2021-09-13 14:20:13,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:13,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153054385] [2021-09-13 14:20:13,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153054385] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:13,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:13,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:20:13,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012307057] [2021-09-13 14:20:13,864 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:20:13,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:13,864 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:20:13,876 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:20:13,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:20:13,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:20:13,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:20:13,877 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:20:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:14,556 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2021-09-13 14:20:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:20:14,556 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:20:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:14,556 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:20:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2021-09-13 14:20:14,557 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:20:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2021-09-13 14:20:14,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2021-09-13 14:20:14,626 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:20:14,627 INFO L225 Difference]: With dead ends: 115 [2021-09-13 14:20:14,627 INFO L226 Difference]: Without dead ends: 113 [2021-09-13 14:20:14,628 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 256.50ms TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:20:14,628 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 154.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.76ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 156.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:14,628 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 1.76ms Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 156.35ms Time] [2021-09-13 14:20:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-09-13 14:20:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2021-09-13 14:20:14,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:14,732 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:20:14,733 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:20:14,733 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:20:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:14,735 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2021-09-13 14:20:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-09-13 14:20:14,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:14,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:14,736 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:20:14,736 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:20:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:14,738 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2021-09-13 14:20:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-09-13 14:20:14,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:14,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:14,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:14,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:14,740 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:20:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2021-09-13 14:20:14,742 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 18 [2021-09-13 14:20:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:14,742 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2021-09-13 14:20:14,742 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:20:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2021-09-13 14:20:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:20:14,743 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:14,743 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:20:14,768 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:20:14,966 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:20:14,967 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:20:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash 971917338, now seen corresponding path program 1 times [2021-09-13 14:20:14,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:14,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965213960] [2021-09-13 14:20:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:14,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:14,975 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:14,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302190801] [2021-09-13 14:20:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:14,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:14,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:14,981 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:20:14,982 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:20:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:15,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:20:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:15,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:15,169 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:20:15,171 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:20:15,171 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:20:15,171 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:20:15,172 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:20:15,172 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:20:15,173 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:20:15,173 INFO L281 TraceCheckUtils]: 7: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:20:15,174 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:20:15,174 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:20:15,175 INFO L281 TraceCheckUtils]: 10: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:20:15,175 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:20:15,176 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:20:15,176 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:20:15,176 INFO L281 TraceCheckUtils]: 14: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:20:15,177 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:20:15,177 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:20:15,177 INFO L281 TraceCheckUtils]: 17: Hoare triple {2738#false} assume 0 == __VERIFIER_assert_~cond; {2738#false} is VALID [2021-09-13 14:20:15,178 INFO L281 TraceCheckUtils]: 18: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2021-09-13 14:20:15,178 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:20:15,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:15,348 INFO L281 TraceCheckUtils]: 18: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2021-09-13 14:20:15,348 INFO L281 TraceCheckUtils]: 17: Hoare triple {2738#false} assume 0 == __VERIFIER_assert_~cond; {2738#false} is VALID [2021-09-13 14:20:15,349 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:20:15,349 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:20:15,349 INFO L281 TraceCheckUtils]: 14: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:20:15,350 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:20:15,350 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:20:15,351 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:20:15,351 INFO L281 TraceCheckUtils]: 10: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:20:15,352 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:20:15,352 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:20:15,353 INFO L281 TraceCheckUtils]: 7: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:20:15,353 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:20:15,353 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:20:15,354 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:20:15,354 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:20:15,355 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:20:15,355 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:20:15,356 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:20:15,356 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:20:15,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:15,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965213960] [2021-09-13 14:20:15,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:15,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302190801] [2021-09-13 14:20:15,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302190801] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:15,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:15,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:20:15,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096868234] [2021-09-13 14:20:15,357 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:20:15,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:15,358 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:20:15,373 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:20:15,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:20:15,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:20:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:20:15,374 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:20:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:16,120 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2021-09-13 14:20:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:20:16,120 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:20:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:16,120 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:20:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2021-09-13 14:20:16,122 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:20:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2021-09-13 14:20:16,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2021-09-13 14:20:16,247 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:20:16,250 INFO L225 Difference]: With dead ends: 225 [2021-09-13 14:20:16,250 INFO L226 Difference]: Without dead ends: 221 [2021-09-13 14:20:16,250 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 97.29ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:20:16,251 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 199.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.27ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 201.50ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:16,251 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 2.27ms Time], IncrementalHoareTripleChecker [18 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 201.50ms Time] [2021-09-13 14:20:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-09-13 14:20:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2021-09-13 14:20:16,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:16,401 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:20:16,401 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:20:16,401 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:20:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:16,405 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2021-09-13 14:20:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-09-13 14:20:16,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:16,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:16,406 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:20:16,406 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:20:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:16,410 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2021-09-13 14:20:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-09-13 14:20:16,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:16,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:16,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:16,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:16,411 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:20:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2021-09-13 14:20:16,413 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 19 [2021-09-13 14:20:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:16,414 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2021-09-13 14:20:16,414 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:20:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2021-09-13 14:20:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:20:16,414 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:16,414 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:20:16,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-09-13 14:20:16,631 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:20:16,631 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:20:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash -367893245, now seen corresponding path program 1 times [2021-09-13 14:20:16,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:16,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220767549] [2021-09-13 14:20:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:16,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:16,647 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:16,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17093889] [2021-09-13 14:20:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:16,647 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:16,656 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:20:16,657 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:20:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:16,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:20:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:16,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:16,983 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:20:16,983 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:20:16,984 INFO L281 TraceCheckUtils]: 2: Hoare triple {3765#true} assume !(0 == assume_abort_if_not_~cond); {3765#true} is VALID [2021-09-13 14:20:16,984 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:20:16,984 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:20:16,985 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:20:16,985 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:20:16,985 INFO L281 TraceCheckUtils]: 7: Hoare triple {3787#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {3787#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:20:16,986 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:20:16,986 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:20:16,987 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 < 100);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:20:16,987 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:20:16,987 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:20:16,988 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 < 100);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:20:16,988 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:20:16,989 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:20:16,989 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:20:16,989 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:20:16,990 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:20:16,990 INFO L281 TraceCheckUtils]: 19: Hoare triple {3766#false} assume !false; {3766#false} is VALID [2021-09-13 14:20:16,990 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:20:16,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:16,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:16,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220767549] [2021-09-13 14:20:16,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:16,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17093889] [2021-09-13 14:20:16,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17093889] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:16,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:16,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:20:16,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589439517] [2021-09-13 14:20:16,997 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:20:16,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:16,997 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:20:17,010 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:20:17,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:20:17,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:17,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:20:17,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:20:17,011 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:20:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:17,427 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2021-09-13 14:20:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:20:17,427 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:20:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:17,427 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:20:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2021-09-13 14:20:17,433 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:20:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2021-09-13 14:20:17,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2021-09-13 14:20:17,492 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:20:17,493 INFO L225 Difference]: With dead ends: 145 [2021-09-13 14:20:17,494 INFO L226 Difference]: Without dead ends: 143 [2021-09-13 14:20:17,494 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 82.53ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:20:17,494 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.34ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.00ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:17,494 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 6.34ms Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 83.00ms Time] [2021-09-13 14:20:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-09-13 14:20:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2021-09-13 14:20:17,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:17,714 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:20:17,714 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:20:17,714 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:20:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:17,716 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-09-13 14:20:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-09-13 14:20:17,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:17,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:17,717 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:20:17,717 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:20:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:17,719 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-09-13 14:20:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-09-13 14:20:17,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:17,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:17,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:17,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:17,720 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:20:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2021-09-13 14:20:17,722 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 20 [2021-09-13 14:20:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:17,722 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2021-09-13 14:20:17,722 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:20:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2021-09-13 14:20:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:20:17,723 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:17,723 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:20:17,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-09-13 14:20:17,936 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:20:17,937 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:20:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1357932506, now seen corresponding path program 1 times [2021-09-13 14:20:17,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:17,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98914273] [2021-09-13 14:20:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:17,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:17,945 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:17,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071393407] [2021-09-13 14:20:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:17,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:17,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:17,969 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:20:17,970 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:20:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:18,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:20:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:18,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:18,177 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:20:18,177 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:20:18,177 INFO L281 TraceCheckUtils]: 2: Hoare triple {4497#true} assume !(0 == assume_abort_if_not_~cond); {4497#true} is VALID [2021-09-13 14:20:18,178 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:20:18,178 INFO L281 TraceCheckUtils]: 4: Hoare triple {4497#true} assume !(0 == assume_abort_if_not_~cond); {4497#true} is VALID [2021-09-13 14:20:18,178 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:20:18,178 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:20:18,178 INFO L281 TraceCheckUtils]: 7: Hoare triple {4497#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {4497#true} is VALID [2021-09-13 14:20:18,178 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:20:18,178 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:20:18,179 INFO L281 TraceCheckUtils]: 10: Hoare triple {4497#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {4497#true} is VALID [2021-09-13 14:20:18,179 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:20:18,179 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:20:18,180 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 < 100);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:20:18,180 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:20:18,181 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:20:18,181 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:20:18,182 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:20:18,182 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:20:18,182 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:20:18,183 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:20:18,183 INFO L281 TraceCheckUtils]: 21: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2021-09-13 14:20:18,183 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:20:18,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:18,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:18,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98914273] [2021-09-13 14:20:18,184 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:18,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071393407] [2021-09-13 14:20:18,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071393407] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:18,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:18,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:20:18,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122513656] [2021-09-13 14:20:18,184 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:20:18,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:18,185 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:20:18,207 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:20:18,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:20:18,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:18,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:20:18,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:20:18,208 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:20:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:18,728 INFO L93 Difference]: Finished difference Result 265 states and 358 transitions. [2021-09-13 14:20:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:20:18,728 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:20:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:18,728 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:20:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-09-13 14:20:18,729 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:20:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-09-13 14:20:18,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2021-09-13 14:20:18,786 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:20:18,789 INFO L225 Difference]: With dead ends: 265 [2021-09-13 14:20:18,790 INFO L226 Difference]: Without dead ends: 263 [2021-09-13 14:20:18,790 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.52ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:20:18,790 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.65ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.08ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:18,790 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.65ms Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 88.08ms Time] [2021-09-13 14:20:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-09-13 14:20:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 162. [2021-09-13 14:20:19,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:19,046 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:20:19,046 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:20:19,046 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:20:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:19,050 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2021-09-13 14:20:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2021-09-13 14:20:19,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:19,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:19,051 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:20:19,051 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:20:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:19,055 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2021-09-13 14:20:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2021-09-13 14:20:19,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:19,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:19,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:19,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:19,056 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:20:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2021-09-13 14:20:19,058 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 22 [2021-09-13 14:20:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:19,058 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2021-09-13 14:20:19,058 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:20:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2021-09-13 14:20:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:20:19,059 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:19,059 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:20:19,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-09-13 14:20:19,272 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:20:19,273 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:20:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:19,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1235592658, now seen corresponding path program 1 times [2021-09-13 14:20:19,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:19,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127700899] [2021-09-13 14:20:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:19,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:19,290 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:19,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626053002] [2021-09-13 14:20:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:19,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:19,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:19,304 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:20:19,305 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:20:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:19,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2021-09-13 14:20:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:19,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:19,779 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:20:19,780 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:20:19,780 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:20:19,784 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:20:19,784 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:20:19,785 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:20:19,785 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:20:19,785 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 < 100);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:20:19,786 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:20:19,786 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:20:19,787 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 < 100);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:20:19,787 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:20:19,788 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:20:19,788 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:20:19,789 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 < 100);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:20:19,789 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:20:19,790 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:20:19,790 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 < 100);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:20:19,790 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:20:19,791 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:20:19,791 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 < 100);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:20:19,792 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:20:19,792 INFO L281 TraceCheckUtils]: 22: Hoare triple {5667#false} assume !false; {5667#false} is VALID [2021-09-13 14:20:19,792 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:20:19,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:19,947 INFO L281 TraceCheckUtils]: 22: Hoare triple {5667#false} assume !false; {5667#false} is VALID [2021-09-13 14:20:19,948 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:20:19,948 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 < 100);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:20:19,949 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:20:19,949 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:20:19,949 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 < 100);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:20:19,949 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:20:19,950 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:20:19,950 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 < 100);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:20:19,950 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:20:19,951 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:20:19,951 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:20:19,951 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 < 100);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:20:19,952 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:20:19,952 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:20:19,952 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 < 100);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:20:19,952 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:20:19,953 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:20:19,953 INFO L281 TraceCheckUtils]: 4: Hoare triple {5666#true} assume !(0 == assume_abort_if_not_~cond); {5666#true} is VALID [2021-09-13 14:20:19,953 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:20:19,953 INFO L281 TraceCheckUtils]: 2: Hoare triple {5666#true} assume !(0 == assume_abort_if_not_~cond); {5666#true} is VALID [2021-09-13 14:20:19,953 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:20:19,954 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:20:19,954 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:20:19,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:19,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127700899] [2021-09-13 14:20:19,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:19,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626053002] [2021-09-13 14:20:19,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626053002] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:19,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:19,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2021-09-13 14:20:19,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687695714] [2021-09-13 14:20:19,955 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:20:19,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:19,955 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:20:19,974 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:20:19,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:20:19,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:20:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:20:19,974 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:20:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:20,670 INFO L93 Difference]: Finished difference Result 230 states and 299 transitions. [2021-09-13 14:20:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:20:20,670 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:20:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:20,670 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:20:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2021-09-13 14:20:20,671 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:20:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2021-09-13 14:20:20,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 102 transitions. [2021-09-13 14:20:20,747 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:20:20,750 INFO L225 Difference]: With dead ends: 230 [2021-09-13 14:20:20,750 INFO L226 Difference]: Without dead ends: 228 [2021-09-13 14:20:20,750 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 87.55ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:20:20,751 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 207.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 208.85ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:20,751 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 374 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [9 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 208.85ms Time] [2021-09-13 14:20:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-09-13 14:20:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2021-09-13 14:20:21,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:21,028 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:20:21,028 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:20:21,028 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:20:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:21,032 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2021-09-13 14:20:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-09-13 14:20:21,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:21,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:21,033 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:20:21,033 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:20:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:21,036 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2021-09-13 14:20:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-09-13 14:20:21,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:21,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:21,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:21,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:21,037 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:20:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2021-09-13 14:20:21,040 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 23 [2021-09-13 14:20:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:21,040 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2021-09-13 14:20:21,040 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:20:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2021-09-13 14:20:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 14:20:21,042 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:21,042 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:20:21,061 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:20:21,257 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:20:21,257 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:20:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash 8471960, now seen corresponding path program 1 times [2021-09-13 14:20:21,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:21,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180061389] [2021-09-13 14:20:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:21,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:21,275 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:21,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821296841] [2021-09-13 14:20:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:21,275 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:21,293 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:20:21,317 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:20:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:21,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:20:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:21,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:21,448 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:20:21,449 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:20:21,451 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:20:21,452 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:20:21,453 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:20:21,453 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:20:21,454 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:20:21,454 INFO L281 TraceCheckUtils]: 7: Hoare triple {6897#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {6897#(<= ~counter~0 1)} is VALID [2021-09-13 14:20:21,454 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:20:21,456 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:20:21,458 INFO L281 TraceCheckUtils]: 10: Hoare triple {6907#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {6907#(<= ~counter~0 2)} is VALID [2021-09-13 14:20:21,458 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:20:21,459 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:20:21,459 INFO L281 TraceCheckUtils]: 13: Hoare triple {6917#(<= |ULTIMATE.start_main_#t~post11| 2)} assume !(main_#t~post11 < 100);havoc main_#t~post11; {6874#false} is VALID [2021-09-13 14:20:21,460 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:20:21,460 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:20:21,460 INFO L281 TraceCheckUtils]: 16: Hoare triple {6874#false} assume !(main_#t~post10 < 100);havoc main_#t~post10; {6874#false} is VALID [2021-09-13 14:20:21,460 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:20:21,460 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:20:21,460 INFO L281 TraceCheckUtils]: 19: Hoare triple {6874#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {6874#false} is VALID [2021-09-13 14:20:21,461 INFO L281 TraceCheckUtils]: 20: Hoare triple {6874#false} assume !(0 != main_~b~0); {6874#false} is VALID [2021-09-13 14:20:21,461 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:20:21,461 INFO L281 TraceCheckUtils]: 22: Hoare triple {6874#false} assume 0 == __VERIFIER_assert_~cond; {6874#false} is VALID [2021-09-13 14:20:21,461 INFO L281 TraceCheckUtils]: 23: Hoare triple {6874#false} assume !false; {6874#false} is VALID [2021-09-13 14:20:21,461 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:20:21,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:21,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:21,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180061389] [2021-09-13 14:20:21,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:21,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821296841] [2021-09-13 14:20:21,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821296841] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:21,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:21,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:20:21,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743411868] [2021-09-13 14:20:21,463 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:20:21,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:21,463 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:20:21,480 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:20:21,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:20:21,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:20:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:20:21,481 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:20:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:21,873 INFO L93 Difference]: Finished difference Result 308 states and 411 transitions. [2021-09-13 14:20:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:20:21,873 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:20:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:21,873 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:20:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2021-09-13 14:20:21,874 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:20:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2021-09-13 14:20:21,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2021-09-13 14:20:21,924 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:20:21,927 INFO L225 Difference]: With dead ends: 308 [2021-09-13 14:20:21,927 INFO L226 Difference]: Without dead ends: 212 [2021-09-13 14:20:21,928 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.01ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:20:21,928 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.31ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.16ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:21,929 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.31ms Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 46.16ms Time] [2021-09-13 14:20:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-09-13 14:20:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-09-13 14:20:22,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:22,192 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:20:22,192 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:20:22,192 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:20:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:22,195 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2021-09-13 14:20:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:20:22,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:22,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:22,196 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:20:22,196 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:20:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:22,199 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2021-09-13 14:20:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:20:22,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:22,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:22,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:22,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:22,200 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:20:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2021-09-13 14:20:22,204 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 24 [2021-09-13 14:20:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:22,204 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2021-09-13 14:20:22,205 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:20:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:20:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-13 14:20:22,206 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:22,206 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:20:22,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-09-13 14:20:22,421 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:20:22,422 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:20:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1993727605, now seen corresponding path program 1 times [2021-09-13 14:20:22,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:22,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390043321] [2021-09-13 14:20:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:22,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:22,428 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:22,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560151081] [2021-09-13 14:20:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:22,428 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:22,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:22,439 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:20:22,440 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:20:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:22,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2021-09-13 14:20:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:22,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:22,817 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:20:22,817 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:20:22,818 INFO L281 TraceCheckUtils]: 2: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:20:22,818 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:20:22,818 INFO L281 TraceCheckUtils]: 4: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:20:22,818 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:20:22,819 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:20:22,820 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 < 100);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:20:22,820 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:20:22,821 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:20:22,822 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 < 100);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:20:22,822 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:20:22,823 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:20:22,823 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:20:22,824 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 < 100);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:20:22,824 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:20:22,824 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:20:22,825 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 < 100);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:20:22,825 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:20:22,825 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:20:22,826 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 < 100);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:20:22,826 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:20:22,827 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:20:22,827 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:20:22,827 INFO L281 TraceCheckUtils]: 24: Hoare triple {8087#false} assume !false; {8087#false} is VALID [2021-09-13 14:20:22,829 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:20:22,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:23,068 INFO L281 TraceCheckUtils]: 24: Hoare triple {8087#false} assume !false; {8087#false} is VALID [2021-09-13 14:20:23,069 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:20:23,069 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:20:23,069 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:20:23,070 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 < 100);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:20:23,070 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:20:23,070 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:20:23,071 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 < 100);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:20:23,071 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:20:23,071 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:20:23,072 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 < 100);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:20:23,072 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:20:23,385 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:20:23,386 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:20:23,386 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 < 100);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:20:23,386 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:20:23,387 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:20:23,387 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 < 100);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:20:23,388 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:20:23,388 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:20:23,388 INFO L281 TraceCheckUtils]: 4: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:20:23,388 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:20:23,388 INFO L281 TraceCheckUtils]: 2: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:20:23,388 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:20:23,389 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:20:23,389 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:20:23,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:23,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390043321] [2021-09-13 14:20:23,389 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:23,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560151081] [2021-09-13 14:20:23,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560151081] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:23,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:23,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:20:23,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379455254] [2021-09-13 14:20:23,390 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:20:23,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:23,391 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:20:23,498 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:20:23,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:20:23,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:20:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:20:23,499 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:20:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:25,563 INFO L93 Difference]: Finished difference Result 532 states and 707 transitions. [2021-09-13 14:20:25,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:20:25,563 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:20:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:25,563 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:20:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 290 transitions. [2021-09-13 14:20:25,565 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:20:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 290 transitions. [2021-09-13 14:20:25,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 290 transitions. [2021-09-13 14:20:27,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 289 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:20:27,975 INFO L225 Difference]: With dead ends: 532 [2021-09-13 14:20:27,975 INFO L226 Difference]: Without dead ends: 526 [2021-09-13 14:20:27,976 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 300.51ms TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:20:27,976 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 508.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 511.33ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:27,976 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [87 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 511.33ms Time] [2021-09-13 14:20:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-09-13 14:20:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 339. [2021-09-13 14:20:28,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:28,676 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:20:28,677 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:20:28,677 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:20:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:28,687 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-09-13 14:20:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 676 transitions. [2021-09-13 14:20:28,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:28,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:28,688 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:20:28,688 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:20:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:28,699 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-09-13 14:20:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 676 transitions. [2021-09-13 14:20:28,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:28,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:28,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:28,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:28,700 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:20:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 460 transitions. [2021-09-13 14:20:28,706 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 460 transitions. Word has length 25 [2021-09-13 14:20:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:28,706 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 460 transitions. [2021-09-13 14:20:28,706 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:20:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 460 transitions. [2021-09-13 14:20:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-13 14:20:28,706 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:28,707 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:20:28,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-09-13 14:20:28,920 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:20:28,921 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:20:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1504234129, now seen corresponding path program 1 times [2021-09-13 14:20:28,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:28,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733698149] [2021-09-13 14:20:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:28,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:28,929 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:28,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812671415] [2021-09-13 14:20:28,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:28,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:28,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:28,930 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:20:28,931 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:20:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:28,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:20:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:28,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:29,185 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:20:29,186 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:20:29,186 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:20:29,187 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:20:29,187 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:20:29,187 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:20:29,188 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:20:29,188 INFO L281 TraceCheckUtils]: 7: Hoare triple {10536#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10536#(<= ~counter~0 1)} is VALID [2021-09-13 14:20:29,189 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:20:29,189 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:20:29,190 INFO L281 TraceCheckUtils]: 10: Hoare triple {10546#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {10546#(<= ~counter~0 2)} is VALID [2021-09-13 14:20:29,190 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:20:29,190 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:20:29,191 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:20:29,191 INFO L281 TraceCheckUtils]: 14: Hoare triple {10559#(<= ~counter~0 3)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10559#(<= ~counter~0 3)} is VALID [2021-09-13 14:20:29,191 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:20:29,192 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:20:29,192 INFO L281 TraceCheckUtils]: 17: Hoare triple {10569#(<= |ULTIMATE.start_main_#t~post10| 3)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:20:29,192 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:20:29,193 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:20:29,193 INFO L281 TraceCheckUtils]: 20: Hoare triple {10513#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:20:29,193 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:20:29,193 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:20:29,193 INFO L281 TraceCheckUtils]: 23: Hoare triple {10513#false} assume !(main_#t~post10 < 100);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:20:29,193 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:20:29,193 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:20:29,194 INFO L281 TraceCheckUtils]: 26: Hoare triple {10513#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:20:29,194 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:20:29,194 INFO L281 TraceCheckUtils]: 28: Hoare triple {10513#false} assume 0 == __VERIFIER_assert_~cond; {10513#false} is VALID [2021-09-13 14:20:29,194 INFO L281 TraceCheckUtils]: 29: Hoare triple {10513#false} assume !false; {10513#false} is VALID [2021-09-13 14:20:29,194 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:20:29,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:29,418 INFO L281 TraceCheckUtils]: 29: Hoare triple {10513#false} assume !false; {10513#false} is VALID [2021-09-13 14:20:29,418 INFO L281 TraceCheckUtils]: 28: Hoare triple {10513#false} assume 0 == __VERIFIER_assert_~cond; {10513#false} is VALID [2021-09-13 14:20:29,419 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:20:29,419 INFO L281 TraceCheckUtils]: 26: Hoare triple {10513#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:20:29,419 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:20:29,419 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:20:29,419 INFO L281 TraceCheckUtils]: 23: Hoare triple {10513#false} assume !(main_#t~post10 < 100);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:20:29,419 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:20:29,419 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:20:29,420 INFO L281 TraceCheckUtils]: 20: Hoare triple {10513#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:20:29,420 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:20:29,420 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:20:29,420 INFO L281 TraceCheckUtils]: 17: Hoare triple {10645#(< |ULTIMATE.start_main_#t~post10| 100)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:20:29,421 INFO L281 TraceCheckUtils]: 16: Hoare triple {10649#(< ~counter~0 100)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10645#(< |ULTIMATE.start_main_#t~post10| 100)} is VALID [2021-09-13 14:20:29,421 INFO L281 TraceCheckUtils]: 15: Hoare triple {10649#(< ~counter~0 100)} 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 100)} is VALID [2021-09-13 14:20:29,421 INFO L281 TraceCheckUtils]: 14: Hoare triple {10649#(< ~counter~0 100)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10649#(< ~counter~0 100)} is VALID [2021-09-13 14:20:29,422 INFO L281 TraceCheckUtils]: 13: Hoare triple {10659#(< ~counter~0 99)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10649#(< ~counter~0 100)} is VALID [2021-09-13 14:20:29,422 INFO L281 TraceCheckUtils]: 12: Hoare triple {10659#(< ~counter~0 99)} 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 99)} is VALID [2021-09-13 14:20:29,423 INFO L281 TraceCheckUtils]: 11: Hoare triple {10659#(< ~counter~0 99)} assume !(main_~c~0 >= main_~b~0); {10659#(< ~counter~0 99)} is VALID [2021-09-13 14:20:29,423 INFO L281 TraceCheckUtils]: 10: Hoare triple {10659#(< ~counter~0 99)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {10659#(< ~counter~0 99)} is VALID [2021-09-13 14:20:29,423 INFO L281 TraceCheckUtils]: 9: Hoare triple {10672#(< ~counter~0 98)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10659#(< ~counter~0 99)} is VALID [2021-09-13 14:20:29,424 INFO L281 TraceCheckUtils]: 8: Hoare triple {10672#(< ~counter~0 98)} 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 98)} is VALID [2021-09-13 14:20:29,424 INFO L281 TraceCheckUtils]: 7: Hoare triple {10672#(< ~counter~0 98)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10672#(< ~counter~0 98)} is VALID [2021-09-13 14:20:29,425 INFO L281 TraceCheckUtils]: 6: Hoare triple {10682#(< ~counter~0 97)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10672#(< ~counter~0 98)} is VALID [2021-09-13 14:20:29,425 INFO L281 TraceCheckUtils]: 5: Hoare triple {10682#(< ~counter~0 97)} 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 97)} is VALID [2021-09-13 14:20:29,425 INFO L281 TraceCheckUtils]: 4: Hoare triple {10682#(< ~counter~0 97)} assume !(0 == assume_abort_if_not_~cond); {10682#(< ~counter~0 97)} is VALID [2021-09-13 14:20:29,426 INFO L281 TraceCheckUtils]: 3: Hoare triple {10682#(< ~counter~0 97)} 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 97)} is VALID [2021-09-13 14:20:29,426 INFO L281 TraceCheckUtils]: 2: Hoare triple {10682#(< ~counter~0 97)} assume !(0 == assume_abort_if_not_~cond); {10682#(< ~counter~0 97)} is VALID [2021-09-13 14:20:29,426 INFO L281 TraceCheckUtils]: 1: Hoare triple {10682#(< ~counter~0 97)} 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 97)} is VALID [2021-09-13 14:20:29,427 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 97)} is VALID [2021-09-13 14:20:29,427 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:20:29,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:29,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733698149] [2021-09-13 14:20:29,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:29,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812671415] [2021-09-13 14:20:29,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812671415] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:29,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:29,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-09-13 14:20:29,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649152148] [2021-09-13 14:20:29,429 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:20:29,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:29,429 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:20:29,461 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:20:29,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:20:29,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:20:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:20:29,462 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:20:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:31,366 INFO L93 Difference]: Finished difference Result 849 states and 1132 transitions. [2021-09-13 14:20:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-13 14:20:31,366 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:20:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:31,367 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:20:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2021-09-13 14:20:31,368 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:20:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2021-09-13 14:20:31,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 218 transitions. [2021-09-13 14:20:31,505 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:20:31,527 INFO L225 Difference]: With dead ends: 849 [2021-09-13 14:20:31,527 INFO L226 Difference]: Without dead ends: 586 [2021-09-13 14:20:31,528 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 88.83ms TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:20:31,528 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 220.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 222.56ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:31,528 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 388 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 222.56ms Time] [2021-09-13 14:20:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-09-13 14:20:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 532. [2021-09-13 14:20:32,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:32,838 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:20:32,838 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:20:32,839 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:20:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:32,850 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2021-09-13 14:20:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 751 transitions. [2021-09-13 14:20:32,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:32,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:32,851 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:20:32,851 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:20:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:32,863 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2021-09-13 14:20:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 751 transitions. [2021-09-13 14:20:32,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:32,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:32,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:32,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:32,864 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:20:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 704 transitions. [2021-09-13 14:20:32,875 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 704 transitions. Word has length 30 [2021-09-13 14:20:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:32,875 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 704 transitions. [2021-09-13 14:20:32,876 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:20:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 704 transitions. [2021-09-13 14:20:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:20:32,876 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:32,876 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:20:32,912 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:20:33,094 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:20:33,094 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:20:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash 685759340, now seen corresponding path program 1 times [2021-09-13 14:20:33,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:33,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685254892] [2021-09-13 14:20:33,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:33,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:33,107 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:33,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478042913] [2021-09-13 14:20:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:33,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:33,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:33,125 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:20:33,177 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:20:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:33,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:20:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:33,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:33,459 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:20:33,459 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:20:33,460 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:20:33,460 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:20:33,461 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:20:33,461 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:20:33,462 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:20:33,462 INFO L281 TraceCheckUtils]: 7: Hoare triple {13826#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {13826#(<= ~counter~0 1)} is VALID [2021-09-13 14:20:33,462 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:20:33,463 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:20:33,463 INFO L281 TraceCheckUtils]: 10: Hoare triple {13836#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {13836#(<= ~counter~0 2)} is VALID [2021-09-13 14:20:33,464 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:20:33,464 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:20:33,464 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:20:33,465 INFO L281 TraceCheckUtils]: 14: Hoare triple {13849#(<= ~counter~0 3)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {13849#(<= ~counter~0 3)} is VALID [2021-09-13 14:20:33,465 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:20:33,465 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:20:33,466 INFO L281 TraceCheckUtils]: 17: Hoare triple {13859#(<= ~counter~0 4)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {13859#(<= ~counter~0 4)} is VALID [2021-09-13 14:20:33,466 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:20:33,466 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:20:33,467 INFO L281 TraceCheckUtils]: 20: Hoare triple {13869#(<= |ULTIMATE.start_main_#t~post11| 4)} assume !(main_#t~post11 < 100);havoc main_#t~post11; {13803#false} is VALID [2021-09-13 14:20:33,467 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:20:33,467 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:20:33,467 INFO L281 TraceCheckUtils]: 23: Hoare triple {13803#false} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {13803#false} is VALID [2021-09-13 14:20:33,467 INFO L281 TraceCheckUtils]: 24: Hoare triple {13803#false} assume !(main_~c~0 >= main_~b~0); {13803#false} is VALID [2021-09-13 14:20:33,467 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:20:33,468 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:20:33,468 INFO L281 TraceCheckUtils]: 27: Hoare triple {13803#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {13803#false} is VALID [2021-09-13 14:20:33,468 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:20:33,468 INFO L281 TraceCheckUtils]: 29: Hoare triple {13803#false} assume 0 == __VERIFIER_assert_~cond; {13803#false} is VALID [2021-09-13 14:20:33,468 INFO L281 TraceCheckUtils]: 30: Hoare triple {13803#false} assume !false; {13803#false} is VALID [2021-09-13 14:20:33,468 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:20:33,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:33,733 INFO L281 TraceCheckUtils]: 30: Hoare triple {13803#false} assume !false; {13803#false} is VALID [2021-09-13 14:20:33,734 INFO L281 TraceCheckUtils]: 29: Hoare triple {13803#false} assume 0 == __VERIFIER_assert_~cond; {13803#false} is VALID [2021-09-13 14:20:33,734 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:20:33,734 INFO L281 TraceCheckUtils]: 27: Hoare triple {13803#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {13803#false} is VALID [2021-09-13 14:20:33,734 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:20:33,734 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:20:33,734 INFO L281 TraceCheckUtils]: 24: Hoare triple {13803#false} assume !(main_~c~0 >= main_~b~0); {13803#false} is VALID [2021-09-13 14:20:33,734 INFO L281 TraceCheckUtils]: 23: Hoare triple {13803#false} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {13803#false} is VALID [2021-09-13 14:20:33,734 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:20:33,735 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:20:33,735 INFO L281 TraceCheckUtils]: 20: Hoare triple {13933#(< |ULTIMATE.start_main_#t~post11| 100)} assume !(main_#t~post11 < 100);havoc main_#t~post11; {13803#false} is VALID [2021-09-13 14:20:33,735 INFO L281 TraceCheckUtils]: 19: Hoare triple {13937#(< ~counter~0 100)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {13933#(< |ULTIMATE.start_main_#t~post11| 100)} is VALID [2021-09-13 14:20:33,736 INFO L281 TraceCheckUtils]: 18: Hoare triple {13937#(< ~counter~0 100)} 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 100)} is VALID [2021-09-13 14:20:33,736 INFO L281 TraceCheckUtils]: 17: Hoare triple {13937#(< ~counter~0 100)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {13937#(< ~counter~0 100)} is VALID [2021-09-13 14:20:33,737 INFO L281 TraceCheckUtils]: 16: Hoare triple {13947#(< ~counter~0 99)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13937#(< ~counter~0 100)} is VALID [2021-09-13 14:20:33,737 INFO L281 TraceCheckUtils]: 15: Hoare triple {13947#(< ~counter~0 99)} 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 99)} is VALID [2021-09-13 14:20:33,738 INFO L281 TraceCheckUtils]: 14: Hoare triple {13947#(< ~counter~0 99)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {13947#(< ~counter~0 99)} is VALID [2021-09-13 14:20:33,738 INFO L281 TraceCheckUtils]: 13: Hoare triple {13957#(< ~counter~0 98)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13947#(< ~counter~0 99)} is VALID [2021-09-13 14:20:33,738 INFO L281 TraceCheckUtils]: 12: Hoare triple {13957#(< ~counter~0 98)} 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 98)} is VALID [2021-09-13 14:20:33,739 INFO L281 TraceCheckUtils]: 11: Hoare triple {13957#(< ~counter~0 98)} assume !(main_~c~0 >= main_~b~0); {13957#(< ~counter~0 98)} is VALID [2021-09-13 14:20:33,739 INFO L281 TraceCheckUtils]: 10: Hoare triple {13957#(< ~counter~0 98)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {13957#(< ~counter~0 98)} is VALID [2021-09-13 14:20:33,740 INFO L281 TraceCheckUtils]: 9: Hoare triple {13970#(< ~counter~0 97)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13957#(< ~counter~0 98)} is VALID [2021-09-13 14:20:33,740 INFO L281 TraceCheckUtils]: 8: Hoare triple {13970#(< ~counter~0 97)} 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 97)} is VALID [2021-09-13 14:20:33,740 INFO L281 TraceCheckUtils]: 7: Hoare triple {13970#(< ~counter~0 97)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {13970#(< ~counter~0 97)} is VALID [2021-09-13 14:20:33,741 INFO L281 TraceCheckUtils]: 6: Hoare triple {13980#(< ~counter~0 96)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13970#(< ~counter~0 97)} is VALID [2021-09-13 14:20:33,741 INFO L281 TraceCheckUtils]: 5: Hoare triple {13980#(< ~counter~0 96)} 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 96)} is VALID [2021-09-13 14:20:33,742 INFO L281 TraceCheckUtils]: 4: Hoare triple {13980#(< ~counter~0 96)} assume !(0 == assume_abort_if_not_~cond); {13980#(< ~counter~0 96)} is VALID [2021-09-13 14:20:33,742 INFO L281 TraceCheckUtils]: 3: Hoare triple {13980#(< ~counter~0 96)} 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 96)} is VALID [2021-09-13 14:20:33,742 INFO L281 TraceCheckUtils]: 2: Hoare triple {13980#(< ~counter~0 96)} assume !(0 == assume_abort_if_not_~cond); {13980#(< ~counter~0 96)} is VALID [2021-09-13 14:20:33,742 INFO L281 TraceCheckUtils]: 1: Hoare triple {13980#(< ~counter~0 96)} 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 96)} is VALID [2021-09-13 14:20:33,743 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 96)} is VALID [2021-09-13 14:20:33,743 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:20:33,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:33,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685254892] [2021-09-13 14:20:33,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:33,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478042913] [2021-09-13 14:20:33,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478042913] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:33,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:33,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-09-13 14:20:33,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437043207] [2021-09-13 14:20:33,745 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:20:33,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:33,745 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:20:33,781 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:20:33,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:20:33,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:33,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:20:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:20:33,782 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:20:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:36,507 INFO L93 Difference]: Finished difference Result 1205 states and 1584 transitions. [2021-09-13 14:20:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:20:36,507 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:20:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:36,508 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:20:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2021-09-13 14:20:36,509 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:20:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2021-09-13 14:20:36,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 281 transitions. [2021-09-13 14:20:36,683 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:20:36,714 INFO L225 Difference]: With dead ends: 1205 [2021-09-13 14:20:36,714 INFO L226 Difference]: Without dead ends: 876 [2021-09-13 14:20:36,714 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 120.28ms TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2021-09-13 14:20:36,715 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 255.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 257.66ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:36,715 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 456 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 257.66ms Time] [2021-09-13 14:20:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-09-13 14:20:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 777. [2021-09-13 14:20:38,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:38,768 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:20:38,768 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:20:38,769 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:20:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:38,791 INFO L93 Difference]: Finished difference Result 876 states and 1091 transitions. [2021-09-13 14:20:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1091 transitions. [2021-09-13 14:20:38,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:38,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:38,793 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:20:38,794 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:20:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:38,817 INFO L93 Difference]: Finished difference Result 876 states and 1091 transitions. [2021-09-13 14:20:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1091 transitions. [2021-09-13 14:20:38,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:38,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:38,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:38,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:38,819 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:20:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1002 transitions. [2021-09-13 14:20:38,842 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1002 transitions. Word has length 31 [2021-09-13 14:20:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:38,842 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1002 transitions. [2021-09-13 14:20:38,842 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:20:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1002 transitions. [2021-09-13 14:20:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:20:38,842 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:38,843 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:20:38,859 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:20:39,059 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:20:39,059 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:20:39,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 13971671, now seen corresponding path program 2 times [2021-09-13 14:20:39,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:39,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154056529] [2021-09-13 14:20:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:39,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:39,064 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:39,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735876867] [2021-09-13 14:20:39,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:20:39,065 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:39,066 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:20:39,067 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:20:39,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:20:39,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:20:39,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:20:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:39,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:39,268 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:20:39,268 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:20:39,269 INFO L281 TraceCheckUtils]: 2: Hoare triple {18529#true} assume !(0 == assume_abort_if_not_~cond); {18529#true} is VALID [2021-09-13 14:20:39,269 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:20:39,269 INFO L281 TraceCheckUtils]: 4: Hoare triple {18529#true} assume !(0 == assume_abort_if_not_~cond); {18529#true} is VALID [2021-09-13 14:20:39,269 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:20:39,269 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:20:39,269 INFO L281 TraceCheckUtils]: 7: Hoare triple {18529#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18529#true} is VALID [2021-09-13 14:20:39,269 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:20:39,269 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:20:39,270 INFO L281 TraceCheckUtils]: 10: Hoare triple {18529#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {18529#true} is VALID [2021-09-13 14:20:39,270 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:20:39,270 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:20:39,271 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:20:39,271 INFO L281 TraceCheckUtils]: 14: Hoare triple {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:20:39,272 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:20:39,272 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:20:39,272 INFO L281 TraceCheckUtils]: 17: Hoare triple {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:20:39,273 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:20:39,273 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:20:39,273 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:20:39,273 INFO L281 TraceCheckUtils]: 21: Hoare triple {18530#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18530#false} is VALID [2021-09-13 14:20:39,273 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:20:39,274 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:20:39,274 INFO L281 TraceCheckUtils]: 24: Hoare triple {18530#false} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {18530#false} is VALID [2021-09-13 14:20:39,274 INFO L281 TraceCheckUtils]: 25: Hoare triple {18530#false} assume !(main_~c~0 >= main_~b~0); {18530#false} is VALID [2021-09-13 14:20:39,274 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:20:39,274 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:20:39,274 INFO L281 TraceCheckUtils]: 28: Hoare triple {18530#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {18530#false} is VALID [2021-09-13 14:20:39,274 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:20:39,274 INFO L281 TraceCheckUtils]: 30: Hoare triple {18530#false} assume 0 == __VERIFIER_assert_~cond; {18530#false} is VALID [2021-09-13 14:20:39,275 INFO L281 TraceCheckUtils]: 31: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2021-09-13 14:20:39,275 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:20:39,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:20:39,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:39,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154056529] [2021-09-13 14:20:39,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:39,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735876867] [2021-09-13 14:20:39,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735876867] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:20:39,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:20:39,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:20:39,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286522270] [2021-09-13 14:20:39,276 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:20:39,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:39,277 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:20:39,298 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:20:39,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:20:39,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:20:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:20:39,299 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:20:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:42,274 INFO L93 Difference]: Finished difference Result 1430 states and 1901 transitions. [2021-09-13 14:20:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:20:42,274 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:20:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:42,275 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:20:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2021-09-13 14:20:42,275 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:20:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2021-09-13 14:20:42,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2021-09-13 14:20:42,367 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:20:42,411 INFO L225 Difference]: With dead ends: 1430 [2021-09-13 14:20:42,411 INFO L226 Difference]: Without dead ends: 1068 [2021-09-13 14:20:42,411 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.26ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:20:42,412 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 146.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 147.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:42,412 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 147.28ms Time] [2021-09-13 14:20:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-09-13 14:20:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 747. [2021-09-13 14:20:44,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:44,486 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:20:44,487 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:20:44,487 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:20:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:44,519 INFO L93 Difference]: Finished difference Result 1068 states and 1400 transitions. [2021-09-13 14:20:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2021-09-13 14:20:44,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:44,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:44,521 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:20:44,521 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:20:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:44,552 INFO L93 Difference]: Finished difference Result 1068 states and 1400 transitions. [2021-09-13 14:20:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2021-09-13 14:20:44,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:44,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:44,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:44,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:44,554 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:20:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 967 transitions. [2021-09-13 14:20:44,573 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 967 transitions. Word has length 32 [2021-09-13 14:20:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:44,573 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 967 transitions. [2021-09-13 14:20:44,573 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:20:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 967 transitions. [2021-09-13 14:20:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:20:44,574 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:44,574 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:20:44,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-09-13 14:20:44,790 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:20:44,791 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:20:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1302269029, now seen corresponding path program 1 times [2021-09-13 14:20:44,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:44,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898686285] [2021-09-13 14:20:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:44,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:44,797 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:44,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232116226] [2021-09-13 14:20:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:44,797 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:44,805 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:20:44,806 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:20:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:44,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2021-09-13 14:20:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:44,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:45,314 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:20:45,315 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:20:45,315 INFO L281 TraceCheckUtils]: 2: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:20:45,315 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:20:45,316 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:20:45,316 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:20:45,316 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:20:45,317 INFO L281 TraceCheckUtils]: 7: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:20:45,317 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:20:45,318 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:20:45,318 INFO L281 TraceCheckUtils]: 10: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:20:45,318 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:20:45,319 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:20:45,319 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 < 100);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:20:45,320 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:20:45,320 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:20:45,321 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:20:45,321 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:20:45,322 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:20:45,322 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:20:45,323 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:20:45,323 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:20:45,323 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:20:45,324 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 < 100);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:20:45,324 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:20:45,325 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:20:45,325 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:20:45,326 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:20:45,326 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:20:45,326 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:20:45,327 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:20:45,327 INFO L281 TraceCheckUtils]: 31: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2021-09-13 14:20:45,327 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:20:45,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:45,574 INFO L281 TraceCheckUtils]: 31: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2021-09-13 14:20:45,574 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:20:45,575 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:20:45,575 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:20:45,576 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:20:45,576 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:20:45,577 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:20:45,577 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:20:45,577 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 < 100);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:20:45,578 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:20:45,580 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:20:45,580 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:20:45,580 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:20:45,581 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:20:45,581 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:20:45,582 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:20:45,582 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:20:45,582 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:20:45,583 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 < 100);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:20:45,583 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:20:45,584 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:20:45,584 INFO L281 TraceCheckUtils]: 10: Hoare triple {23817#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {23817#true} is VALID [2021-09-13 14:20:45,584 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:20:45,584 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:20:45,584 INFO L281 TraceCheckUtils]: 7: Hoare triple {23817#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {23817#true} is VALID [2021-09-13 14:20:45,584 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:20:45,584 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:20:45,584 INFO L281 TraceCheckUtils]: 4: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:20:45,585 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:20:45,585 INFO L281 TraceCheckUtils]: 2: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:20:45,585 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:20:45,585 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:20:45,585 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:20:45,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:45,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898686285] [2021-09-13 14:20:45,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:45,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232116226] [2021-09-13 14:20:45,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232116226] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:45,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:45,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2021-09-13 14:20:45,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306603506] [2021-09-13 14:20:45,587 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:20:45,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:45,587 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:20:45,627 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:20:45,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:20:45,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:20:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:20:45,628 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:20:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:48,774 INFO L93 Difference]: Finished difference Result 866 states and 1122 transitions. [2021-09-13 14:20:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:20:48,774 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:20:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:20:48,775 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:20:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2021-09-13 14:20:48,775 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:20:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2021-09-13 14:20:48,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 130 transitions. [2021-09-13 14:20:48,883 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:20:48,916 INFO L225 Difference]: With dead ends: 866 [2021-09-13 14:20:48,916 INFO L226 Difference]: Without dead ends: 864 [2021-09-13 14:20:48,917 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 277.51ms TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:20:48,917 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 224.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.48ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 226.37ms IncrementalHoareTripleChecker+Time [2021-09-13 14:20:48,917 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 1.48ms Time], IncrementalHoareTripleChecker [21 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 226.37ms Time] [2021-09-13 14:20:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-09-13 14:20:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 595. [2021-09-13 14:20:50,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:20:50,640 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:20:50,640 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:20:50,641 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:20:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:50,664 INFO L93 Difference]: Finished difference Result 864 states and 1089 transitions. [2021-09-13 14:20:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2021-09-13 14:20:50,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:50,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:50,665 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:20:50,666 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:20:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:20:50,688 INFO L93 Difference]: Finished difference Result 864 states and 1089 transitions. [2021-09-13 14:20:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2021-09-13 14:20:50,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:20:50,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:20:50,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:20:50,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:20:50,689 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:20:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 754 transitions. [2021-09-13 14:20:50,702 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 754 transitions. Word has length 32 [2021-09-13 14:20:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:20:50,702 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 754 transitions. [2021-09-13 14:20:50,702 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:20:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 754 transitions. [2021-09-13 14:20:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-09-13 14:20:50,703 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:20:50,703 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:20:50,733 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:20:50,920 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:20:50,920 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:20:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:20:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash 885134474, now seen corresponding path program 1 times [2021-09-13 14:20:50,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:20:50,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168363911] [2021-09-13 14:20:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:50,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:20:50,934 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:20:50,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662118528] [2021-09-13 14:20:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:20:50,935 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:20:50,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:20:50,935 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:20:50,936 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:20:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:50,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2021-09-13 14:20:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:20:50,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:20:52,336 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:20:52,336 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:20:52,336 INFO L281 TraceCheckUtils]: 2: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:20:52,336 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:20:52,337 INFO L281 TraceCheckUtils]: 4: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:20:52,337 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:20:52,337 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:20:52,338 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 < 100);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:20:52,338 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:20:52,339 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:20:52,339 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 < 100);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:20:52,340 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:20:52,340 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:20:52,341 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 < 100);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:20:52,341 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:20:52,342 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:20:52,342 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:20:52,343 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:20:52,343 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:20:52,344 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:20:52,344 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:20:52,345 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:20:52,345 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:20:52,346 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:20:52,346 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 < 100);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:20:52,347 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:20:52,347 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:20:52,348 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:20:52,348 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 < 100);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:20:52,349 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:20:52,349 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:20:52,350 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:20:52,350 INFO L281 TraceCheckUtils]: 32: Hoare triple {27811#false} assume !false; {27811#false} is VALID [2021-09-13 14:20:52,350 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:20:52,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:20:53,226 INFO L281 TraceCheckUtils]: 32: Hoare triple {27811#false} assume !false; {27811#false} is VALID [2021-09-13 14:20:53,226 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:20:53,227 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:20:53,227 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:20:53,228 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 < 100);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:20:53,228 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:20:53,512 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:20:53,513 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:20:53,513 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 < 100);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:20:53,513 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:20:53,557 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:20:53,558 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:20:53,558 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:20:53,558 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:20:53,559 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:20:53,559 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:20:53,559 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:20:53,560 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:20:53,561 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:20:53,561 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 < 100);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:20:53,562 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:20:53,562 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:20:53,563 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 < 100);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:20:53,563 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:20:53,564 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:20:53,564 INFO L281 TraceCheckUtils]: 7: Hoare triple {27810#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {27810#true} is VALID [2021-09-13 14:20:53,564 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:20:53,564 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:20:53,564 INFO L281 TraceCheckUtils]: 4: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:20:53,564 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:20:53,564 INFO L281 TraceCheckUtils]: 2: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:20:53,564 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:20:53,564 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:20:53,565 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:20:53,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:20:53,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168363911] [2021-09-13 14:20:53,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:20:53,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662118528] [2021-09-13 14:20:53,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662118528] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:20:53,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:20:53,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-09-13 14:20:53,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48812593] [2021-09-13 14:20:53,566 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:20:53,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:20:53,566 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:20:53,703 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:20:53,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 14:20:53,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:20:53,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 14:20:53,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:20:53,704 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:21:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:08,738 INFO L93 Difference]: Finished difference Result 1157 states and 1472 transitions. [2021-09-13 14:21:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-09-13 14:21:08,739 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:21:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:08,739 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:21:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 324 transitions. [2021-09-13 14:21:08,740 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:21:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 324 transitions. [2021-09-13 14:21:08,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 324 transitions. [2021-09-13 14:21:09,934 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:21:09,983 INFO L225 Difference]: With dead ends: 1157 [2021-09-13 14:21:09,983 INFO L226 Difference]: Without dead ends: 1147 [2021-09-13 14:21:09,984 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 3022.64ms TimeCoverageRelationStatistics Valid=692, Invalid=3090, Unknown=0, NotChecked=0, Total=3782 [2021-09-13 14:21:09,984 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 467 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4240.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.62ms SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4250.10ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:09,985 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 0 Invalid, 1294 Unknown, 0 Unchecked, 4.62ms Time], IncrementalHoareTripleChecker [167 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 4250.10ms Time] [2021-09-13 14:21:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-09-13 14:21:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 785. [2021-09-13 14:21:11,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:11,809 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:21:11,810 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:21:11,810 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:21:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:11,845 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2021-09-13 14:21:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1440 transitions. [2021-09-13 14:21:11,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:11,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:11,846 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:21:11,847 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:21:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:11,882 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2021-09-13 14:21:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1440 transitions. [2021-09-13 14:21:11,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:11,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:11,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:11,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:11,884 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:21:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1013 transitions. [2021-09-13 14:21:11,906 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1013 transitions. Word has length 33 [2021-09-13 14:21:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:11,924 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1013 transitions. [2021-09-13 14:21:11,924 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:21:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1013 transitions. [2021-09-13 14:21:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:21:11,925 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:11,925 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:21:11,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:21:12,141 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:21:12,142 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:21:12,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1517440196, now seen corresponding path program 1 times [2021-09-13 14:21:12,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:12,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395886160] [2021-09-13 14:21:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:12,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:12,160 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:12,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880997037] [2021-09-13 14:21:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:12,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:12,161 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:21:12,162 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:21:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:12,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:21:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:12,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:12,459 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:21:12,460 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:21:12,460 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:21:12,460 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:21:12,460 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:21:12,461 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:21:12,462 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:21:12,462 INFO L281 TraceCheckUtils]: 7: Hoare triple {33126#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {33126#(<= ~counter~0 1)} is VALID [2021-09-13 14:21:12,462 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:21:12,463 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:21:12,463 INFO L281 TraceCheckUtils]: 10: Hoare triple {33136#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {33136#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:12,463 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:21:12,463 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:21:12,464 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:21:12,464 INFO L281 TraceCheckUtils]: 14: Hoare triple {33149#(<= ~counter~0 3)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {33149#(<= ~counter~0 3)} is VALID [2021-09-13 14:21:12,464 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:21:12,465 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:21:12,465 INFO L281 TraceCheckUtils]: 17: Hoare triple {33159#(<= ~counter~0 4)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {33159#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:12,465 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:21:12,466 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:21:12,466 INFO L281 TraceCheckUtils]: 20: Hoare triple {33169#(<= ~counter~0 5)} assume !!(main_#t~post11 < 100);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:21:12,466 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:21:12,467 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:21:12,467 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:21:12,467 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:21:12,467 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:21:12,468 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:21:12,468 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:21:12,468 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:21:12,468 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:21:12,469 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:21:12,469 INFO L281 TraceCheckUtils]: 31: Hoare triple {33203#(<= ~counter~0 6)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {33203#(<= ~counter~0 6)} is VALID [2021-09-13 14:21:12,470 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:21:12,470 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:21:12,470 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:21:12,470 INFO L281 TraceCheckUtils]: 35: Hoare triple {33216#(<= |ULTIMATE.start_main_#t~post9| 6)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {33103#false} is VALID [2021-09-13 14:21:12,470 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:21:12,471 INFO L281 TraceCheckUtils]: 37: Hoare triple {33103#false} assume 0 == __VERIFIER_assert_~cond; {33103#false} is VALID [2021-09-13 14:21:12,471 INFO L281 TraceCheckUtils]: 38: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2021-09-13 14:21:12,471 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:21:12,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:21:12,763 INFO L281 TraceCheckUtils]: 38: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2021-09-13 14:21:12,764 INFO L281 TraceCheckUtils]: 37: Hoare triple {33103#false} assume 0 == __VERIFIER_assert_~cond; {33103#false} is VALID [2021-09-13 14:21:12,764 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:21:12,764 INFO L281 TraceCheckUtils]: 35: Hoare triple {33238#(< |ULTIMATE.start_main_#t~post9| 100)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {33103#false} is VALID [2021-09-13 14:21:12,764 INFO L281 TraceCheckUtils]: 34: Hoare triple {33242#(< ~counter~0 100)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33238#(< |ULTIMATE.start_main_#t~post9| 100)} is VALID [2021-09-13 14:21:12,765 INFO L281 TraceCheckUtils]: 33: Hoare triple {33242#(< ~counter~0 100)} 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 100)} is VALID [2021-09-13 14:21:12,765 INFO L281 TraceCheckUtils]: 32: Hoare triple {33242#(< ~counter~0 100)} assume !(main_~c~0 >= main_~b~0); {33242#(< ~counter~0 100)} is VALID [2021-09-13 14:21:12,765 INFO L281 TraceCheckUtils]: 31: Hoare triple {33242#(< ~counter~0 100)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {33242#(< ~counter~0 100)} is VALID [2021-09-13 14:21:12,766 INFO L281 TraceCheckUtils]: 30: Hoare triple {33255#(< ~counter~0 99)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33242#(< ~counter~0 100)} is VALID [2021-09-13 14:21:12,766 INFO L281 TraceCheckUtils]: 29: Hoare triple {33255#(< ~counter~0 99)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,766 INFO L281 TraceCheckUtils]: 28: Hoare triple {33255#(< ~counter~0 99)} assume !(main_~c~0 >= 2 * main_~v~0); {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,767 INFO L281 TraceCheckUtils]: 27: Hoare triple {33255#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,767 INFO L281 TraceCheckUtils]: 26: Hoare triple {33255#(< ~counter~0 99)} __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 99)} is VALID [2021-09-13 14:21:12,767 INFO L281 TraceCheckUtils]: 25: Hoare triple {33255#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,767 INFO L281 TraceCheckUtils]: 24: Hoare triple {33255#(< ~counter~0 99)} __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 99)} is VALID [2021-09-13 14:21:12,768 INFO L281 TraceCheckUtils]: 23: Hoare triple {33255#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,768 INFO L281 TraceCheckUtils]: 22: Hoare triple {33255#(< ~counter~0 99)} __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 99)} is VALID [2021-09-13 14:21:12,768 INFO L281 TraceCheckUtils]: 21: Hoare triple {33255#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,769 INFO L281 TraceCheckUtils]: 20: Hoare triple {33255#(< ~counter~0 99)} assume !!(main_#t~post11 < 100);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 99)} is VALID [2021-09-13 14:21:12,769 INFO L281 TraceCheckUtils]: 19: Hoare triple {33289#(< ~counter~0 98)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {33255#(< ~counter~0 99)} is VALID [2021-09-13 14:21:12,769 INFO L281 TraceCheckUtils]: 18: Hoare triple {33289#(< ~counter~0 98)} 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 98)} is VALID [2021-09-13 14:21:12,770 INFO L281 TraceCheckUtils]: 17: Hoare triple {33289#(< ~counter~0 98)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {33289#(< ~counter~0 98)} is VALID [2021-09-13 14:21:12,770 INFO L281 TraceCheckUtils]: 16: Hoare triple {33299#(< ~counter~0 97)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33289#(< ~counter~0 98)} is VALID [2021-09-13 14:21:12,770 INFO L281 TraceCheckUtils]: 15: Hoare triple {33299#(< ~counter~0 97)} 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 97)} is VALID [2021-09-13 14:21:12,771 INFO L281 TraceCheckUtils]: 14: Hoare triple {33299#(< ~counter~0 97)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {33299#(< ~counter~0 97)} is VALID [2021-09-13 14:21:12,771 INFO L281 TraceCheckUtils]: 13: Hoare triple {33309#(< ~counter~0 96)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33299#(< ~counter~0 97)} is VALID [2021-09-13 14:21:12,771 INFO L281 TraceCheckUtils]: 12: Hoare triple {33309#(< ~counter~0 96)} 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 96)} is VALID [2021-09-13 14:21:12,772 INFO L281 TraceCheckUtils]: 11: Hoare triple {33309#(< ~counter~0 96)} assume !(main_~c~0 >= main_~b~0); {33309#(< ~counter~0 96)} is VALID [2021-09-13 14:21:12,772 INFO L281 TraceCheckUtils]: 10: Hoare triple {33309#(< ~counter~0 96)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {33309#(< ~counter~0 96)} is VALID [2021-09-13 14:21:12,772 INFO L281 TraceCheckUtils]: 9: Hoare triple {33322#(< ~counter~0 95)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33309#(< ~counter~0 96)} is VALID [2021-09-13 14:21:12,773 INFO L281 TraceCheckUtils]: 8: Hoare triple {33322#(< ~counter~0 95)} 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 95)} is VALID [2021-09-13 14:21:12,773 INFO L281 TraceCheckUtils]: 7: Hoare triple {33322#(< ~counter~0 95)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {33322#(< ~counter~0 95)} is VALID [2021-09-13 14:21:12,773 INFO L281 TraceCheckUtils]: 6: Hoare triple {33332#(< ~counter~0 94)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33322#(< ~counter~0 95)} is VALID [2021-09-13 14:21:12,774 INFO L281 TraceCheckUtils]: 5: Hoare triple {33332#(< ~counter~0 94)} 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 94)} is VALID [2021-09-13 14:21:12,774 INFO L281 TraceCheckUtils]: 4: Hoare triple {33332#(< ~counter~0 94)} assume !(0 == assume_abort_if_not_~cond); {33332#(< ~counter~0 94)} is VALID [2021-09-13 14:21:12,774 INFO L281 TraceCheckUtils]: 3: Hoare triple {33332#(< ~counter~0 94)} 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 94)} is VALID [2021-09-13 14:21:12,774 INFO L281 TraceCheckUtils]: 2: Hoare triple {33332#(< ~counter~0 94)} assume !(0 == assume_abort_if_not_~cond); {33332#(< ~counter~0 94)} is VALID [2021-09-13 14:21:12,775 INFO L281 TraceCheckUtils]: 1: Hoare triple {33332#(< ~counter~0 94)} 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 94)} is VALID [2021-09-13 14:21:12,775 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 94)} is VALID [2021-09-13 14:21:12,775 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:21:12,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:21:12,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395886160] [2021-09-13 14:21:12,776 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:21:12,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880997037] [2021-09-13 14:21:12,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880997037] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:21:12,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:21:12,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-09-13 14:21:12,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624280686] [2021-09-13 14:21:12,777 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:21:12,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:21:12,778 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:21:12,833 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:21:12,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-09-13 14:21:12,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:21:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-09-13 14:21:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:21:12,834 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:21:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:17,707 INFO L93 Difference]: Finished difference Result 1756 states and 2299 transitions. [2021-09-13 14:21:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-09-13 14:21:17,708 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:21:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:17,708 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:21:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 340 transitions. [2021-09-13 14:21:17,710 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:21:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 340 transitions. [2021-09-13 14:21:17,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 340 transitions. [2021-09-13 14:21:17,952 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:21:18,084 INFO L225 Difference]: With dead ends: 1756 [2021-09-13 14:21:18,085 INFO L226 Difference]: Without dead ends: 1752 [2021-09-13 14:21:18,085 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 173.32ms TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2021-09-13 14:21:18,086 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 283.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.60ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 285.29ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:18,086 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 1.60ms Time], IncrementalHoareTripleChecker [78 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 285.29ms Time] [2021-09-13 14:21:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-09-13 14:21:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1354. [2021-09-13 14:21:21,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:21,382 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:21:21,382 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:21:21,405 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:21:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:21,576 INFO L93 Difference]: Finished difference Result 1752 states and 2219 transitions. [2021-09-13 14:21:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2219 transitions. [2021-09-13 14:21:21,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:21,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:21,579 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:21:21,580 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:21:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:21,716 INFO L93 Difference]: Finished difference Result 1752 states and 2219 transitions. [2021-09-13 14:21:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2219 transitions. [2021-09-13 14:21:21,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:21,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:21,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:21,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:21,720 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:21:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1753 transitions. [2021-09-13 14:21:21,783 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1753 transitions. Word has length 39 [2021-09-13 14:21:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:21,783 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 1753 transitions. [2021-09-13 14:21:21,783 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:21:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1753 transitions. [2021-09-13 14:21:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:21:21,784 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:21,784 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:21:21,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-09-13 14:21:22,002 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:21:22,003 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:21:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:22,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1573117064, now seen corresponding path program 1 times [2021-09-13 14:21:22,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:22,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448838446] [2021-09-13 14:21:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:22,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:22,008 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:22,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235421105] [2021-09-13 14:21:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:22,008 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:22,012 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:21:22,014 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:21:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:22,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:21:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:22,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:22,226 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:21:22,226 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:21:22,226 INFO L281 TraceCheckUtils]: 2: Hoare triple {41174#true} assume !(0 == assume_abort_if_not_~cond); {41174#true} is VALID [2021-09-13 14:21:22,226 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:21:22,226 INFO L281 TraceCheckUtils]: 4: Hoare triple {41174#true} assume !(0 == assume_abort_if_not_~cond); {41174#true} is VALID [2021-09-13 14:21:22,226 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:21:22,226 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:21:22,227 INFO L281 TraceCheckUtils]: 7: Hoare triple {41174#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {41174#true} is VALID [2021-09-13 14:21:22,227 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:21:22,227 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:21:22,227 INFO L281 TraceCheckUtils]: 10: Hoare triple {41174#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {41174#true} is VALID [2021-09-13 14:21:22,227 INFO L281 TraceCheckUtils]: 11: Hoare triple {41174#true} assume !(main_~c~0 >= main_~b~0); {41174#true} is VALID [2021-09-13 14:21:22,227 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:21:22,227 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:21:22,227 INFO L281 TraceCheckUtils]: 14: Hoare triple {41174#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {41174#true} is VALID [2021-09-13 14:21:22,228 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:21:22,228 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:21:22,228 INFO L281 TraceCheckUtils]: 17: Hoare triple {41174#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {41174#true} is VALID [2021-09-13 14:21:22,228 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:21:22,228 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:21:22,229 INFO L281 TraceCheckUtils]: 20: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post11 < 100);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:21:22,229 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:21:22,229 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:21:22,230 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:21:22,230 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:21:22,230 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:21:22,230 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:21:22,231 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:21:22,231 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:21:22,232 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:21:22,232 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:21:22,232 INFO L281 TraceCheckUtils]: 31: Hoare triple {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:21:22,233 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:21:22,233 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:21:22,233 INFO L281 TraceCheckUtils]: 34: Hoare triple {41175#false} assume !!(main_#t~post11 < 100);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:21:22,233 INFO L281 TraceCheckUtils]: 35: Hoare triple {41175#false} assume !(0 == __VERIFIER_assert_~cond); {41175#false} is VALID [2021-09-13 14:21:22,233 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:21:22,233 INFO L281 TraceCheckUtils]: 37: Hoare triple {41175#false} assume !(0 == __VERIFIER_assert_~cond); {41175#false} is VALID [2021-09-13 14:21:22,233 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:21:22,233 INFO L281 TraceCheckUtils]: 39: Hoare triple {41175#false} assume 0 == __VERIFIER_assert_~cond; {41175#false} is VALID [2021-09-13 14:21:22,234 INFO L281 TraceCheckUtils]: 40: Hoare triple {41175#false} assume !false; {41175#false} is VALID [2021-09-13 14:21:22,234 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:21:22,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:21:22,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:21:22,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448838446] [2021-09-13 14:21:22,234 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:21:22,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235421105] [2021-09-13 14:21:22,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235421105] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:21:22,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:21:22,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:21:22,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640707180] [2021-09-13 14:21:22,235 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:21:22,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:21:22,236 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:21:22,259 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:21:22,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:21:22,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:21:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:21:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:21:22,260 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:21:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:28,579 INFO L93 Difference]: Finished difference Result 2784 states and 3644 transitions. [2021-09-13 14:21:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:21:28,580 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:21:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:28,580 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:21:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2021-09-13 14:21:28,581 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:21:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2021-09-13 14:21:28,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2021-09-13 14:21:28,649 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:21:28,811 INFO L225 Difference]: With dead ends: 2784 [2021-09-13 14:21:28,812 INFO L226 Difference]: Without dead ends: 1767 [2021-09-13 14:21:28,813 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.40ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:21:28,813 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.95ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:28,814 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 99.95ms Time] [2021-09-13 14:21:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2021-09-13 14:21:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1620. [2021-09-13 14:21:33,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:33,983 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:21:33,984 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:21:33,985 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:21:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:34,086 INFO L93 Difference]: Finished difference Result 1767 states and 2267 transitions. [2021-09-13 14:21:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2267 transitions. [2021-09-13 14:21:34,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:34,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:34,089 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:21:34,090 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:21:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:34,177 INFO L93 Difference]: Finished difference Result 1767 states and 2267 transitions. [2021-09-13 14:21:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2267 transitions. [2021-09-13 14:21:34,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:34,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:34,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:34,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:34,180 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:21:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2083 transitions. [2021-09-13 14:21:34,322 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2083 transitions. Word has length 41 [2021-09-13 14:21:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:34,322 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 2083 transitions. [2021-09-13 14:21:34,322 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:21:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2083 transitions. [2021-09-13 14:21:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:21:34,323 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:34,323 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:21:34,343 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:21:34,539 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:21:34,540 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:21:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash -149759960, now seen corresponding path program 2 times [2021-09-13 14:21:34,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:34,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967739856] [2021-09-13 14:21:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:34,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:34,583 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:34,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240046931] [2021-09-13 14:21:34,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:21:34,584 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:34,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:34,584 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:21:34,585 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:21:34,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-09-13 14:21:34,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:21:34,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:21:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:34,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:34,847 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:21:34,847 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:21:34,848 INFO L281 TraceCheckUtils]: 2: Hoare triple {50949#true} assume !(0 == assume_abort_if_not_~cond); {50949#true} is VALID [2021-09-13 14:21:34,848 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:21:34,848 INFO L281 TraceCheckUtils]: 4: Hoare triple {50949#true} assume !(0 == assume_abort_if_not_~cond); {50949#true} is VALID [2021-09-13 14:21:34,848 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:21:34,848 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:21:34,848 INFO L281 TraceCheckUtils]: 7: Hoare triple {50949#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {50949#true} is VALID [2021-09-13 14:21:34,848 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:21:34,848 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:21:34,849 INFO L281 TraceCheckUtils]: 10: Hoare triple {50949#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {50949#true} is VALID [2021-09-13 14:21:34,849 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:21:34,849 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:21:34,849 INFO L281 TraceCheckUtils]: 13: Hoare triple {50949#true} assume !!(main_#t~post11 < 100);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:21:34,849 INFO L281 TraceCheckUtils]: 14: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:21:34,849 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:21:34,849 INFO L281 TraceCheckUtils]: 16: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:21:34,849 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:21:34,850 INFO L281 TraceCheckUtils]: 18: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:21:34,850 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:21:34,850 INFO L281 TraceCheckUtils]: 20: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:21:34,850 INFO L281 TraceCheckUtils]: 21: Hoare triple {50949#true} assume !(main_~c~0 >= 2 * main_~v~0); {50949#true} is VALID [2021-09-13 14:21:34,850 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:21:34,850 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:21:34,850 INFO L281 TraceCheckUtils]: 24: Hoare triple {50949#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10; {50949#true} is VALID [2021-09-13 14:21:34,850 INFO L281 TraceCheckUtils]: 25: Hoare triple {50949#true} assume !(main_~c~0 >= main_~b~0); {50949#true} is VALID [2021-09-13 14:21:34,850 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:21:34,851 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:21:34,851 INFO L281 TraceCheckUtils]: 28: Hoare triple {50949#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {50949#true} is VALID [2021-09-13 14:21:34,851 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:21:34,851 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:21:34,852 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 < 100);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:21:34,852 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:21:34,853 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:21:34,853 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 < 100);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:21:34,854 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:21:34,854 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:21:34,854 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:21:34,855 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:21:34,855 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:21:34,855 INFO L281 TraceCheckUtils]: 40: Hoare triple {50950#false} assume !false; {50950#false} is VALID [2021-09-13 14:21:34,855 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:21:34,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:21:34,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:21:34,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967739856] [2021-09-13 14:21:34,856 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:21:34,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240046931] [2021-09-13 14:21:34,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240046931] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:21:34,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:21:34,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:21:34,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822257716] [2021-09-13 14:21:34,857 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:21:34,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:21:34,858 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:21:34,874 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:21:34,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:21:34,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:21:34,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:21:34,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:21:34,875 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:21:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:40,912 INFO L93 Difference]: Finished difference Result 1761 states and 2260 transitions. [2021-09-13 14:21:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:21:40,912 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:21:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:40,912 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:21:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2021-09-13 14:21:40,913 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:21:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2021-09-13 14:21:40,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2021-09-13 14:21:40,959 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:21:41,077 INFO L225 Difference]: With dead ends: 1761 [2021-09-13 14:21:41,077 INFO L226 Difference]: Without dead ends: 1759 [2021-09-13 14:21:41,077 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.85ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:21:41,078 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.29ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.01ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:41,078 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.29ms Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 48.01ms Time] [2021-09-13 14:21:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2021-09-13 14:21:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1720. [2021-09-13 14:21:48,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:48,471 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:21:48,472 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:21:48,473 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:21:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:48,558 INFO L93 Difference]: Finished difference Result 1759 states and 2226 transitions. [2021-09-13 14:21:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2226 transitions. [2021-09-13 14:21:48,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:48,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:48,560 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:21:48,561 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:21:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:48,645 INFO L93 Difference]: Finished difference Result 1759 states and 2226 transitions. [2021-09-13 14:21:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2226 transitions. [2021-09-13 14:21:48,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:48,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:48,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:48,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:48,648 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:21:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2189 transitions. [2021-09-13 14:21:48,757 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2189 transitions. Word has length 41 [2021-09-13 14:21:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:48,757 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2189 transitions. [2021-09-13 14:21:48,757 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:21:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2189 transitions. [2021-09-13 14:21:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-09-13 14:21:48,758 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:48,758 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:21:48,775 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:21:48,974 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:21:48,975 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:21:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1891302024, now seen corresponding path program 1 times [2021-09-13 14:21:48,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:48,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204333045] [2021-09-13 14:21:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:48,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:48,980 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:48,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008526059] [2021-09-13 14:21:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:48,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:48,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:48,983 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:21:48,984 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:21:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:49,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjunts are in the unsatisfiable core [2021-09-13 14:21:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:49,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:51,518 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:21:51,519 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:21:51,519 INFO L281 TraceCheckUtils]: 2: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:21:51,519 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:21:51,519 INFO L281 TraceCheckUtils]: 4: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:21:51,520 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:21:51,520 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:21:51,520 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 < 100);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:21:51,521 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:21:51,521 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:21:51,521 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 < 100);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:21:51,522 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:21:51,522 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:21:51,522 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 < 100);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:21:51,523 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:21:51,523 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:21:51,523 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:21:51,524 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:21:51,524 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:21:51,525 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:21:51,525 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:21:51,526 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:21:51,526 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:21:51,527 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 < 100);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:21:51,527 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:21:51,553 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:21:51,553 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:21:51,554 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:21:51,554 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:21:51,555 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:21:51,555 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:21:51,556 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:21:51,559 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:21:51,559 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:21:51,560 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 < 100);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:21:51,560 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:21:51,560 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:21:51,561 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 < 100);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:21:51,561 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:21:51,562 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:21:51,562 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:21:51,563 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:21:51,563 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:21:51,563 INFO L281 TraceCheckUtils]: 43: Hoare triple {59471#false} assume !false; {59471#false} is VALID [2021-09-13 14:21:51,563 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:21:51,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:02,053 INFO L281 TraceCheckUtils]: 43: Hoare triple {59471#false} assume !false; {59471#false} is VALID [2021-09-13 14:22:02,054 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:22:02,054 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:22:02,055 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:22:04,056 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:22:04,057 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:22:04,057 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 < 100);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:22:04,058 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:22:04,058 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:22:04,059 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 < 100);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:22:04,059 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:22:04,061 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:22:04,062 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:22:04,062 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:22:04,063 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:22:04,063 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:22:04,063 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:22:04,064 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:22:04,064 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:22:04,065 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:22:04,065 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 < 100);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:22:04,065 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:22:04,069 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:22:04,069 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:22:04,069 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:22:04,070 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:22:04,070 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:22:04,070 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:22:04,071 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:22:04,071 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:22:04,071 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 < 100);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:22:04,072 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:22:04,074 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:22:04,074 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 < 100);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:22:04,075 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:22:04,075 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:22:04,075 INFO L281 TraceCheckUtils]: 7: Hoare triple {59470#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {59470#true} is VALID [2021-09-13 14:22:04,075 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:22:04,075 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:22:04,075 INFO L281 TraceCheckUtils]: 4: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:22:04,076 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:22:04,076 INFO L281 TraceCheckUtils]: 2: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:22:04,076 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:22:04,076 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:22:04,076 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:22:04,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:22:04,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204333045] [2021-09-13 14:22:04,076 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:22:04,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008526059] [2021-09-13 14:22:04,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008526059] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:22:04,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:22:04,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-09-13 14:22:04,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130848309] [2021-09-13 14:22:04,077 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:22:04,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:04,078 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:22:06,165 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:22:06,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-09-13 14:22:06,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:22:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-09-13 14:22:06,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2021-09-13 14:22:06,167 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:22:21,363 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:22:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-09-13 14:22:21,366 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4709.65ms TimeCoverageRelationStatistics Valid=1008, Invalid=2184, Unknown=0, NotChecked=0, Total=3192 [2021-09-13 14:22:21,367 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 482 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 145 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3695.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3701.87ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:21,367 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 0 Invalid, 811 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [145 Valid, 665 Invalid, 1 Unknown, 0 Unchecked, 3701.87ms Time] [2021-09-13 14:22:21,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-09-13 14:22:21,583 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:22:21,584 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@3fc028d4 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:22:21,607 INFO L158 Benchmark]: Toolchain (without parser) took 133831.91ms. Allocated memory was 58.7MB in the beginning and 627.0MB in the end (delta: 568.3MB). Free memory was 43.8MB in the beginning and 476.1MB in the end (delta: -432.3MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. [2021-09-13 14:22:21,608 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 51.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:21,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.12ms. Allocated memory is still 58.7MB. Free memory was 43.6MB in the beginning and 32.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:22:21,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.12ms. Allocated memory is still 58.7MB. Free memory was 32.7MB in the beginning and 41.7MB in the end (delta: -9.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:22:21,608 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 58.7MB. Free memory was 41.7MB in the beginning and 40.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:22:21,608 INFO L158 Benchmark]: RCFGBuilder took 294.41ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 29.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:22:21,609 INFO L158 Benchmark]: TraceAbstraction took 133223.76ms. Allocated memory was 58.7MB in the beginning and 627.0MB in the end (delta: 568.3MB). Free memory was 28.6MB in the beginning and 476.1MB in the end (delta: -447.5MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. [2021-09-13 14:22:21,612 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.14ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 51.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.12ms. Allocated memory is still 58.7MB. Free memory was 43.6MB in the beginning and 32.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.12ms. Allocated memory is still 58.7MB. Free memory was 32.7MB in the beginning and 41.7MB in the end (delta: -9.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 58.7MB. Free memory was 41.7MB in the beginning and 40.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.41ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 29.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 133223.76ms. Allocated memory was 58.7MB in the beginning and 627.0MB in the end (delta: 568.3MB). Free memory was 28.6MB in the beginning and 476.1MB in the end (delta: -447.5MB). Peak memory consumption was 120.8MB. 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@3fc028d4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@3fc028d4: 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:22:21,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:22:24,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:22:24,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:22:24,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:22:24,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:22:24,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:22:24,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:22:24,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:22:24,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:22:24,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:22:24,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:22:24,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:22:24,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:22:24,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:22:24,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:22:24,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:22:24,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:22:24,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:22:24,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:22:24,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:22:24,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:22:24,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:22:24,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:22:24,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:22:24,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:22:24,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:22:24,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:22:24,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:22:24,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:22:24,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:22:24,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:22:24,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:22:24,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:22:24,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:22:24,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:22:24,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:22:24,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:22:24,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:22:24,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:22:24,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:22:24,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:22:24,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-09-13 14:22:24,911 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:22:24,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:22:24,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:22:24,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:22:24,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:22:24,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:22:24,914 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:22:24,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:22:24,914 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:22:24,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:22:24,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:22:24,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:22:24,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:22:24,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:22:24,916 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:22:24,916 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:22:24,916 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:22:24,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:22:24,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:22:24,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:22:24,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:22:24,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:22:24,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:22:24,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:22:24,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:22:24,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:22:24,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:22:24,929 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:22:24,929 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:22:24,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:22:24,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:22:24,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:22:24,930 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 -> 2c276e2f4567029b3fa5de9c90b3a06c874f34cf [2021-09-13 14:22:25,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:22:25,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:22:25,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:22:25,323 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:22:25,323 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:22:25,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2021-09-13 14:22:25,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82043d50/9f065465bec24d869dcdd54ab63164bc/FLAG5134e22d5 [2021-09-13 14:22:25,750 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:22:25,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2021-09-13 14:22:25,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82043d50/9f065465bec24d869dcdd54ab63164bc/FLAG5134e22d5 [2021-09-13 14:22:26,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82043d50/9f065465bec24d869dcdd54ab63164bc [2021-09-13 14:22:26,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:22:26,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:22:26,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:22:26,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:22:26,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:22:26,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4908580f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26, skipping insertion in model container [2021-09-13 14:22:26,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:22:26,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:22:26,730 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_unwindbound100.c[490,503] [2021-09-13 14:22:26,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:22:26,750 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:22:26,785 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_unwindbound100.c[490,503] [2021-09-13 14:22:26,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:22:26,806 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:22:26,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26 WrapperNode [2021-09-13 14:22:26,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:22:26,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:22:26,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:22:26,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:22:26,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:22:26,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:22:26,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:22:26,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:22:26,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:22:26,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:22:26,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:22:26,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:22:26,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (1/1) ... [2021-09-13 14:22:26,869 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:22:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:26,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:22:26,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:22:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:22:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:22:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:22:26,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:22:30,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:22:30,825 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-09-13 14:22:30,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:22:30 BoogieIcfgContainer [2021-09-13 14:22:30,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:22:30,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:22:30,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:22:30,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:22:30,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:22:26" (1/3) ... [2021-09-13 14:22:30,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b08b0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:22:30, skipping insertion in model container [2021-09-13 14:22:30,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:26" (2/3) ... [2021-09-13 14:22:30,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b08b0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:22:30, skipping insertion in model container [2021-09-13 14:22:30,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:22:30" (3/3) ... [2021-09-13 14:22:30,832 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.c [2021-09-13 14:22:30,835 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:22:30,835 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:22:30,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:22:30,867 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:22:30,867 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:22:30,876 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:22:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:22:30,879 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:30,880 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:30,880 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:22:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1233339761, now seen corresponding path program 1 times [2021-09-13 14:22:30,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:30,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464245885] [2021-09-13 14:22:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:30,892 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:30,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:30,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:22:30,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 14:22:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:31,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:22:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:31,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:31,087 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:22:31,088 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:22:31,088 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:22:31,088 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:22:31,089 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:22:31,089 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:22:31,089 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:22:31,089 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:22:31,090 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:22:31,090 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:22:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:31,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:31,135 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:22:31,135 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:22:31,135 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:22:31,136 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:22:31,136 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:22:31,136 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:22:31,136 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:22:31,137 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:22:31,137 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:22:31,137 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:22:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:31,138 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:22:31,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464245885] [2021-09-13 14:22:31,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464245885] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:31,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:31,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:22:31,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125943969] [2021-09-13 14:22:31,143 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:22:31,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:31,146 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:22:31,226 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:22:31,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:22:31,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:22:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:22:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:22:31,242 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:22:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:33,248 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-09-13 14:22:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:22:33,249 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:22:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:33,250 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:22:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:22:33,254 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:22:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:22:33,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2021-09-13 14:22:33,711 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:22:33,717 INFO L225 Difference]: With dead ends: 77 [2021-09-13 14:22:33,717 INFO L226 Difference]: Without dead ends: 36 [2021-09-13 14:22:33,719 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.06ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:22:33,721 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 889.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 890.66ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:33,723 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 890.66ms Time] [2021-09-13 14:22:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-13 14:22:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-13 14:22:33,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:33,752 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:22:33,752 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:22:33,752 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:22:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:33,757 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:22:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:22:33,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:33,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:33,759 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:22:33,760 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:22:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:33,763 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:22:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:22:33,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:33,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:33,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:33,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:33,765 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:22:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-09-13 14:22:33,768 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2021-09-13 14:22:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:33,769 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-09-13 14:22:33,770 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:22:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:22:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:22:33,772 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:33,772 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:33,786 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:22:33,983 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:22:33,984 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:22:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1507359540, now seen corresponding path program 1 times [2021-09-13 14:22:33,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:33,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66403179] [2021-09-13 14:22:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:33,988 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:33,989 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:22:33,998 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:22:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:34,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:22:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:34,263 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:22:34,264 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:22:34,264 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:22:34,264 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:22:34,265 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:22:34,265 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:22:34,266 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:22:34,266 INFO L281 TraceCheckUtils]: 7: Hoare triple {335#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {312#false} is VALID [2021-09-13 14:22:34,266 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:22:34,267 INFO L281 TraceCheckUtils]: 9: Hoare triple {312#false} assume 0bv32 == __VERIFIER_assert_~cond; {312#false} is VALID [2021-09-13 14:22:34,267 INFO L281 TraceCheckUtils]: 10: Hoare triple {312#false} assume !false; {312#false} is VALID [2021-09-13 14:22:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:34,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:34,371 INFO L281 TraceCheckUtils]: 10: Hoare triple {312#false} assume !false; {312#false} is VALID [2021-09-13 14:22:34,371 INFO L281 TraceCheckUtils]: 9: Hoare triple {312#false} assume 0bv32 == __VERIFIER_assert_~cond; {312#false} is VALID [2021-09-13 14:22:34,371 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:22:34,372 INFO L281 TraceCheckUtils]: 7: Hoare triple {357#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv100 32))} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {312#false} is VALID [2021-09-13 14:22:34,372 INFO L281 TraceCheckUtils]: 6: Hoare triple {361#(bvslt ~counter~0 (_ bv100 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {357#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv100 32))} is VALID [2021-09-13 14:22:34,373 INFO L281 TraceCheckUtils]: 5: Hoare triple {361#(bvslt ~counter~0 (_ bv100 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 (_ bv100 32))} is VALID [2021-09-13 14:22:34,373 INFO L281 TraceCheckUtils]: 4: Hoare triple {361#(bvslt ~counter~0 (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {361#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:34,374 INFO L281 TraceCheckUtils]: 3: Hoare triple {361#(bvslt ~counter~0 (_ bv100 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 (_ bv100 32))} is VALID [2021-09-13 14:22:34,374 INFO L281 TraceCheckUtils]: 2: Hoare triple {361#(bvslt ~counter~0 (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {361#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:34,375 INFO L281 TraceCheckUtils]: 1: Hoare triple {361#(bvslt ~counter~0 (_ bv100 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 (_ bv100 32))} is VALID [2021-09-13 14:22:34,376 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 (_ bv100 32))} is VALID [2021-09-13 14:22:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:34,376 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:22:34,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66403179] [2021-09-13 14:22:34,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66403179] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:34,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:34,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-09-13 14:22:34,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324118582] [2021-09-13 14:22:34,378 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:22:34,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:34,378 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:22:34,462 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:22:34,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:22:34,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:22:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:22:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:22:34,463 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:22:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:43,900 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2021-09-13 14:22:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:22:43,901 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:22:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:43,901 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:22:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-09-13 14:22:43,902 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:22:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-09-13 14:22:43,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2021-09-13 14:22:44,299 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:22:44,300 INFO L225 Difference]: With dead ends: 48 [2021-09-13 14:22:44,300 INFO L226 Difference]: Without dead ends: 44 [2021-09-13 14:22:44,300 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.41ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:22:44,301 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4139.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.02ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4143.67ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:44,301 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 167 Unknown, 0 Unchecked, 3.02ms Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 4143.67ms Time] [2021-09-13 14:22:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-09-13 14:22:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2021-09-13 14:22:44,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:44,309 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:22:44,310 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:22:44,311 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:22:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:44,313 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-09-13 14:22:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-09-13 14:22:44,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:44,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:44,314 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:22:44,315 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:22:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:44,320 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-09-13 14:22:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-09-13 14:22:44,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:44,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:44,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:44,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:44,321 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:22:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 14:22:44,336 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2021-09-13 14:22:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:44,336 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 14:22:44,336 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:22:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:22:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:22:44,337 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:44,337 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:44,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-09-13 14:22:44,547 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:22:44,548 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:22:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:44,548 INFO L82 PathProgramCache]: Analyzing trace with hash 515746917, now seen corresponding path program 1 times [2021-09-13 14:22:44,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:44,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151403964] [2021-09-13 14:22:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:44,549 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:44,550 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:22:44,552 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:22:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:44,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:22:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:44,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:44,913 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:22:44,913 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:22:44,913 INFO L281 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(0bv32 == assume_abort_if_not_~cond); {572#true} is VALID [2021-09-13 14:22:44,914 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:22:44,914 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:22:44,916 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:22:44,916 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:22:44,917 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, 100bv32);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:22:44,917 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:22:44,918 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:22:44,918 INFO L281 TraceCheckUtils]: 10: Hoare triple {573#false} assume 0bv32 == __VERIFIER_assert_~cond; {573#false} is VALID [2021-09-13 14:22:44,918 INFO L281 TraceCheckUtils]: 11: Hoare triple {573#false} assume !false; {573#false} is VALID [2021-09-13 14:22:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:44,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:45,135 INFO L281 TraceCheckUtils]: 11: Hoare triple {573#false} assume !false; {573#false} is VALID [2021-09-13 14:22:45,136 INFO L281 TraceCheckUtils]: 10: Hoare triple {573#false} assume 0bv32 == __VERIFIER_assert_~cond; {573#false} is VALID [2021-09-13 14:22:45,136 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:22:45,136 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:22:45,137 INFO L281 TraceCheckUtils]: 7: Hoare triple {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:22:45,137 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:22:45,138 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:22:45,138 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:22:45,139 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:22:45,139 INFO L281 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(0bv32 == assume_abort_if_not_~cond); {572#true} is VALID [2021-09-13 14:22:45,139 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:22:45,139 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:22:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:45,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:22:45,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151403964] [2021-09-13 14:22:45,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151403964] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:45,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:45,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-09-13 14:22:45,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444400103] [2021-09-13 14:22:45,141 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:22:45,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:45,141 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:22:45,236 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:22:45,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:22:45,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:22:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:22:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:22:45,237 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:22:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:55,031 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-09-13 14:22:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:22:55,031 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:22:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:55,031 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:22:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2021-09-13 14:22:55,032 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:22:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2021-09-13 14:22:55,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2021-09-13 14:22:55,403 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:22:55,404 INFO L225 Difference]: With dead ends: 43 [2021-09-13 14:22:55,404 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:22:55,405 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 291.28ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:22:55,405 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4416.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.55ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 4419.41ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:55,406 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 2.55ms Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 3 Unchecked, 4419.41ms Time] [2021-09-13 14:22:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:22:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:22:55,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:55,411 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:22:55,412 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:22:55,412 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:22:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:55,413 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-09-13 14:22:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:22:55,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:55,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:55,414 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:22:55,414 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:22:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:55,415 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-09-13 14:22:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:22:55,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:55,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:55,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:55,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:55,416 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:22:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-09-13 14:22:55,417 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2021-09-13 14:22:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:55,417 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-09-13 14:22:55,418 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:22:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:22:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:22:55,418 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:55,418 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:22:55,429 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:22:55,629 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:22:55,630 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:22:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1270616931, now seen corresponding path program 1 times [2021-09-13 14:22:55,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:55,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111555650] [2021-09-13 14:22:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:55,631 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:55,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:55,632 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:22:55,633 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:22:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:55,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:22:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:55,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:56,573 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:22:56,574 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:22:56,574 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:22:56,575 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:22:56,575 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:22:56,576 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:22:56,576 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:22:56,577 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, 100bv32);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:22:56,577 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:22:56,578 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:22:56,578 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, 100bv32);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:22:56,579 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:22:56,579 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:22:56,580 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, 100bv32);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:22:56,580 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:22:56,581 INFO L281 TraceCheckUtils]: 15: Hoare triple {829#false} assume !false; {829#false} is VALID [2021-09-13 14:22:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:56,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:23:03,735 INFO L281 TraceCheckUtils]: 15: Hoare triple {829#false} assume !false; {829#false} is VALID [2021-09-13 14:23:03,736 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:23:03,736 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, 100bv32);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:23:03,737 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:23:03,737 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:23:03,738 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, 100bv32);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:23:03,738 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:23:03,738 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:23:03,739 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, 100bv32);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:23:03,739 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:23:03,740 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:23:03,740 INFO L281 TraceCheckUtils]: 4: Hoare triple {828#true} assume !(0bv32 == assume_abort_if_not_~cond); {828#true} is VALID [2021-09-13 14:23:03,740 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:23:03,740 INFO L281 TraceCheckUtils]: 2: Hoare triple {828#true} assume !(0bv32 == assume_abort_if_not_~cond); {828#true} is VALID [2021-09-13 14:23:03,740 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:23:03,740 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:23:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:23:03,740 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:23:03,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111555650] [2021-09-13 14:23:03,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111555650] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:23:03,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:23:03,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:23:03,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130642789] [2021-09-13 14:23:03,741 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:23:03,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:23:03,741 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:23:04,101 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:23:04,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:23:04,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:23:04,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:23:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:23:04,102 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:23:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:48,768 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2021-09-13 14:23:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:23:48,768 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:23:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:23:48,769 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:23:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2021-09-13 14:23:48,770 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:23:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2021-09-13 14:23:48,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2021-09-13 14:23:49,625 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:23:49,627 INFO L225 Difference]: With dead ends: 80 [2021-09-13 14:23:49,627 INFO L226 Difference]: Without dead ends: 78 [2021-09-13 14:23:49,627 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3645.90ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:23:49,628 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18944.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.61ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18948.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:23:49,628 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 6.61ms Time], IncrementalHoareTripleChecker [27 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 18948.35ms Time] [2021-09-13 14:23:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-09-13 14:23:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2021-09-13 14:23:49,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:23:49,652 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:23:49,652 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:23:49,652 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:23:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:49,653 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-09-13 14:23:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-09-13 14:23:49,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:49,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:49,654 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:23:49,654 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:23:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:49,656 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-09-13 14:23:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-09-13 14:23:49,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:49,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:49,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:23:49,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:23:49,657 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:23:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2021-09-13 14:23:49,658 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2021-09-13 14:23:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:23:49,658 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2021-09-13 14:23:49,658 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:23:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2021-09-13 14:23:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:23:49,658 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:23:49,658 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:23:49,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:23:49,859 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:23:49,859 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:23:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:23:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -648504839, now seen corresponding path program 1 times [2021-09-13 14:23:49,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:23:49,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042674366] [2021-09-13 14:23:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:23:49,860 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:23:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:23:49,863 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:23:49,868 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:23:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:50,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:23:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:50,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:23:50,193 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:23:50,194 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:23:50,194 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:23:50,194 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:23:50,195 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:23:50,195 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:23:50,196 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:23:50,196 INFO L281 TraceCheckUtils]: 7: Hoare triple {1289#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1289#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:23:50,196 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:23:50,197 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:23:50,197 INFO L281 TraceCheckUtils]: 10: Hoare triple {1299#(= (_ bv1 32) |ULTIMATE.start_main_#t~post10|)} assume !~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10; {1266#false} is VALID [2021-09-13 14:23:50,197 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:23:50,197 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:23:50,197 INFO L281 TraceCheckUtils]: 13: Hoare triple {1266#false} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1266#false} is VALID [2021-09-13 14:23:50,198 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:23:50,198 INFO L281 TraceCheckUtils]: 15: Hoare triple {1266#false} assume 0bv32 == __VERIFIER_assert_~cond; {1266#false} is VALID [2021-09-13 14:23:50,198 INFO L281 TraceCheckUtils]: 16: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2021-09-13 14:23:50,198 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:23:50,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:23:50,344 INFO L281 TraceCheckUtils]: 16: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2021-09-13 14:23:50,345 INFO L281 TraceCheckUtils]: 15: Hoare triple {1266#false} assume 0bv32 == __VERIFIER_assert_~cond; {1266#false} is VALID [2021-09-13 14:23:50,345 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:23:50,345 INFO L281 TraceCheckUtils]: 13: Hoare triple {1266#false} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1266#false} is VALID [2021-09-13 14:23:50,345 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:23:50,345 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:23:50,346 INFO L281 TraceCheckUtils]: 10: Hoare triple {1339#(bvslt |ULTIMATE.start_main_#t~post10| (_ bv100 32))} assume !~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10; {1266#false} is VALID [2021-09-13 14:23:50,346 INFO L281 TraceCheckUtils]: 9: Hoare triple {1343#(bvslt ~counter~0 (_ bv100 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1339#(bvslt |ULTIMATE.start_main_#t~post10| (_ bv100 32))} is VALID [2021-09-13 14:23:50,346 INFO L281 TraceCheckUtils]: 8: Hoare triple {1343#(bvslt ~counter~0 (_ bv100 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 (_ bv100 32))} is VALID [2021-09-13 14:23:50,347 INFO L281 TraceCheckUtils]: 7: Hoare triple {1343#(bvslt ~counter~0 (_ bv100 32))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1343#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:23:50,347 INFO L281 TraceCheckUtils]: 6: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1343#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:23:50,347 INFO L281 TraceCheckUtils]: 5: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 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)) (_ bv100 32))} is VALID [2021-09-13 14:23:50,348 INFO L281 TraceCheckUtils]: 4: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} is VALID [2021-09-13 14:23:50,348 INFO L281 TraceCheckUtils]: 3: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 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)) (_ bv100 32))} is VALID [2021-09-13 14:23:50,348 INFO L281 TraceCheckUtils]: 2: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} is VALID [2021-09-13 14:23:50,349 INFO L281 TraceCheckUtils]: 1: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 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)) (_ bv100 32))} is VALID [2021-09-13 14:23:50,349 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)) (_ bv100 32))} is VALID [2021-09-13 14:23:50,350 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:23:50,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:23:50,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042674366] [2021-09-13 14:23:50,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042674366] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:23:50,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:23:50,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-09-13 14:23:50,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129365515] [2021-09-13 14:23:50,350 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:23:50,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:23:50,351 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:23:50,508 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:23:50,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:23:50,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:23:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:23:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:23:50,509 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:24:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:11,726 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2021-09-13 14:24:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:24:11,726 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:24:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:11,726 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:24:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2021-09-13 14:24:11,727 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:24:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2021-09-13 14:24:11,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2021-09-13 14:24:12,594 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:24:12,595 INFO L225 Difference]: With dead ends: 116 [2021-09-13 14:24:12,595 INFO L226 Difference]: Without dead ends: 86 [2021-09-13 14:24:12,596 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 119.07ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:24:12,596 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9690.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9693.85ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:12,596 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [7 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 9693.85ms Time] [2021-09-13 14:24:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-09-13 14:24:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2021-09-13 14:24:12,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:12,642 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:24:12,643 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:24:12,643 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:24:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:12,644 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-09-13 14:24:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2021-09-13 14:24:12,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:12,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:12,645 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:24:12,645 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:24:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:12,647 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-09-13 14:24:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2021-09-13 14:24:12,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:12,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:12,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:12,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:12,648 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:24:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2021-09-13 14:24:12,649 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 17 [2021-09-13 14:24:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:12,649 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2021-09-13 14:24:12,649 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:24:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2021-09-13 14:24:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:24:12,650 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:12,650 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:24:12,668 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:24:12,864 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:24:12,865 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:24:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1354097033, now seen corresponding path program 1 times [2021-09-13 14:24:12,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:24:12,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913220935] [2021-09-13 14:24:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:12,866 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:24:12,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:24:12,867 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:24:12,868 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:24:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:13,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:24:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:13,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:13,284 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:24:13,285 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:24:13,285 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:24:13,285 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:24:13,286 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:24:13,286 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:24:13,286 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:24:13,287 INFO L281 TraceCheckUtils]: 7: Hoare triple {1816#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1816#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:24:13,287 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:24:13,287 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:24:13,288 INFO L281 TraceCheckUtils]: 10: Hoare triple {1826#(= (_ bv2 32) ~counter~0)} assume !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10; {1826#(= (_ bv2 32) ~counter~0)} is VALID [2021-09-13 14:24:13,288 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:24:13,289 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:24:13,289 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:24:13,289 INFO L281 TraceCheckUtils]: 14: Hoare triple {1839#(= (_ bv2 32) |ULTIMATE.start_main_#t~post9|)} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1793#false} is VALID [2021-09-13 14:24:13,290 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:24:13,290 INFO L281 TraceCheckUtils]: 16: Hoare triple {1793#false} assume 0bv32 == __VERIFIER_assert_~cond; {1793#false} is VALID [2021-09-13 14:24:13,290 INFO L281 TraceCheckUtils]: 17: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2021-09-13 14:24:13,290 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:24:13,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:13,484 INFO L281 TraceCheckUtils]: 17: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2021-09-13 14:24:13,484 INFO L281 TraceCheckUtils]: 16: Hoare triple {1793#false} assume 0bv32 == __VERIFIER_assert_~cond; {1793#false} is VALID [2021-09-13 14:24:13,485 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:24:13,485 INFO L281 TraceCheckUtils]: 14: Hoare triple {1861#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv100 32))} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1793#false} is VALID [2021-09-13 14:24:13,485 INFO L281 TraceCheckUtils]: 13: Hoare triple {1865#(bvslt ~counter~0 (_ bv100 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1861#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv100 32))} is VALID [2021-09-13 14:24:13,486 INFO L281 TraceCheckUtils]: 12: Hoare triple {1865#(bvslt ~counter~0 (_ bv100 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 (_ bv100 32))} is VALID [2021-09-13 14:24:13,486 INFO L281 TraceCheckUtils]: 11: Hoare triple {1865#(bvslt ~counter~0 (_ bv100 32))} assume !~bvsge64(main_~c~0, main_~b~0); {1865#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:24:13,487 INFO L281 TraceCheckUtils]: 10: Hoare triple {1865#(bvslt ~counter~0 (_ bv100 32))} assume !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10; {1865#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:24:13,487 INFO L281 TraceCheckUtils]: 9: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1865#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:24:13,487 INFO L281 TraceCheckUtils]: 8: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 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)) (_ bv100 32))} is VALID [2021-09-13 14:24:13,488 INFO L281 TraceCheckUtils]: 7: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} is VALID [2021-09-13 14:24:13,490 INFO L281 TraceCheckUtils]: 6: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv100 32))} is VALID [2021-09-13 14:24:13,490 INFO L281 TraceCheckUtils]: 5: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 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) (_ bv100 32))} is VALID [2021-09-13 14:24:13,491 INFO L281 TraceCheckUtils]: 4: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 32))} is VALID [2021-09-13 14:24:13,491 INFO L281 TraceCheckUtils]: 3: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 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) (_ bv100 32))} is VALID [2021-09-13 14:24:13,491 INFO L281 TraceCheckUtils]: 2: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 32))} is VALID [2021-09-13 14:24:13,492 INFO L281 TraceCheckUtils]: 1: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv100 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) (_ bv100 32))} is VALID [2021-09-13 14:24:13,492 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) (_ bv100 32))} is VALID [2021-09-13 14:24:13,498 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:24:13,498 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:24:13,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913220935] [2021-09-13 14:24:13,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913220935] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:13,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:13,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:24:13,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374610316] [2021-09-13 14:24:13,499 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:24:13,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:13,499 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:24:13,765 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:24:13,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:24:13,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:24:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:24:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:24:13,766 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:24:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:44,191 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2021-09-13 14:24:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:24:44,191 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:24:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:44,191 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:24:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2021-09-13 14:24:44,192 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:24:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2021-09-13 14:24:44,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 143 transitions. [2021-09-13 14:24:45,654 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:24:45,656 INFO L225 Difference]: With dead ends: 156 [2021-09-13 14:24:45,656 INFO L226 Difference]: Without dead ends: 152 [2021-09-13 14:24:45,656 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 268.36ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:24:45,657 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12761.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.43ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12766.61ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:45,657 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 5.43ms Time], IncrementalHoareTripleChecker [20 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 12766.61ms Time] [2021-09-13 14:24:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-09-13 14:24:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 93. [2021-09-13 14:24:45,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:45,726 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:24:45,726 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:24:45,726 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:24:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:45,729 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2021-09-13 14:24:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-09-13 14:24:45,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:45,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:45,730 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:24:45,730 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:24:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:45,732 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2021-09-13 14:24:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-09-13 14:24:45,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:45,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:45,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:45,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:45,733 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:24:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2021-09-13 14:24:45,735 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 18 [2021-09-13 14:24:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:45,735 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2021-09-13 14:24:45,735 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:24:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2021-09-13 14:24:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:24:45,735 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:45,735 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:45,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-09-13 14:24:45,948 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:24:45,949 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:24:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1292001664, now seen corresponding path program 1 times [2021-09-13 14:24:45,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:24:45,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457692529] [2021-09-13 14:24:45,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:45,950 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:24:45,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:24:45,950 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:24:45,952 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:24:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:46,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:24:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:46,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:46,962 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:24:46,963 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:24:46,963 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:24:46,964 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:24:46,964 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:24:46,965 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:24:46,965 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:24:46,966 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, 100bv32);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:24:46,967 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:24:46,968 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:24:46,968 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, 100bv32);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:24:46,970 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:24:46,970 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:24:46,971 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, 100bv32);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:24:46,971 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:24:46,972 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:24:46,972 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:24:46,972 INFO L281 TraceCheckUtils]: 17: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2021-09-13 14:24:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:46,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:57,567 INFO L281 TraceCheckUtils]: 17: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2021-09-13 14:24:57,568 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:24:57,568 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:24:57,569 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:24:57,569 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, 100bv32);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:24:57,569 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:24:57,570 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:24:57,570 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, 100bv32);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:24:57,571 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:24:57,571 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:24:57,571 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, 100bv32);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:24:57,572 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:24:57,572 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:24:57,572 INFO L281 TraceCheckUtils]: 4: Hoare triple {2544#true} assume !(0bv32 == assume_abort_if_not_~cond); {2544#true} is VALID [2021-09-13 14:24:57,572 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:24:57,572 INFO L281 TraceCheckUtils]: 2: Hoare triple {2544#true} assume !(0bv32 == assume_abort_if_not_~cond); {2544#true} is VALID [2021-09-13 14:24:57,572 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:24:57,572 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:24:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:57,573 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:24:57,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457692529] [2021-09-13 14:24:57,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457692529] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:24:57,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:24:57,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:24:57,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904274517] [2021-09-13 14:24:57,573 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:24:57,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:57,574 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:24:58,307 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:24:58,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:24:58,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:24:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:24:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:24:58,308 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:25:44,138 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:46,285 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:55,565 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2021-09-13 14:25:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:25:55,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 14:25:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:55,566 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:25:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2021-09-13 14:25:55,567 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:25:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2021-09-13 14:25:55,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2021-09-13 14:25:56,601 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:25:56,602 INFO L225 Difference]: With dead ends: 126 [2021-09-13 14:25:56,602 INFO L226 Difference]: Without dead ends: 124 [2021-09-13 14:25:56,602 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4770.95ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:25:56,603 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25818.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.92ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25823.82ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:56,603 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 297 Unknown, 0 Unchecked, 4.92ms Time], IncrementalHoareTripleChecker [27 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 25823.82ms Time] [2021-09-13 14:25:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-09-13 14:25:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2021-09-13 14:25:56,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:56,677 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:25:56,677 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:25:56,678 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:25:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,680 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2021-09-13 14:25:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-09-13 14:25:56,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,680 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:25:56,680 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:25:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,682 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2021-09-13 14:25:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-09-13 14:25:56,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:56,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:56,683 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:25:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2021-09-13 14:25:56,684 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 18 [2021-09-13 14:25:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:56,684 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2021-09-13 14:25:56,684 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:25:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2021-09-13 14:25:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:25:56,685 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:56,685 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:56,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-09-13 14:25:56,896 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:25:56,896 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 971917338, now seen corresponding path program 1 times [2021-09-13 14:25:56,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:25:56,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056992978] [2021-09-13 14:25:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:56,897 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:25:56,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:25:56,898 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:25:56,900 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:25:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:57,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:25:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:57,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:57,434 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:25:57,435 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:25:57,436 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:25:57,436 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:25:57,436 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:25:57,438 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:25:57,438 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:25:57,438 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, 100bv32);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:25:57,439 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:25:57,439 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:25:57,439 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, 100bv32);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:25:57,440 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:25:57,440 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:25:57,441 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:25:57,441 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, 100bv32);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:25:57,442 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:25:57,442 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:25:57,442 INFO L281 TraceCheckUtils]: 17: Hoare triple {3206#false} assume 0bv32 == __VERIFIER_assert_~cond; {3206#false} is VALID [2021-09-13 14:25:57,442 INFO L281 TraceCheckUtils]: 18: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2021-09-13 14:25:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:57,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:57,920 INFO L281 TraceCheckUtils]: 18: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2021-09-13 14:25:57,920 INFO L281 TraceCheckUtils]: 17: Hoare triple {3206#false} assume 0bv32 == __VERIFIER_assert_~cond; {3206#false} is VALID [2021-09-13 14:25:57,920 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:25:57,921 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:25:57,921 INFO L281 TraceCheckUtils]: 14: Hoare triple {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:25:57,921 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:25:57,922 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:25:57,922 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:25:57,922 INFO L281 TraceCheckUtils]: 10: Hoare triple {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10; {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:25:57,923 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:25:57,923 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:25:57,924 INFO L281 TraceCheckUtils]: 7: Hoare triple {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:25:57,924 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:25:57,924 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:25:57,925 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:25:57,925 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:25:57,926 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:25:57,926 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:25:57,926 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:25:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:57,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:25:57,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056992978] [2021-09-13 14:25:57,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056992978] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:57,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:57,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-09-13 14:25:57,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027130968] [2021-09-13 14:25:57,927 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:25:57,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:57,927 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:25:58,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:58,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:25:58,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:25:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:25:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:25:58,161 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:26:05,644 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:26:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:10,823 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2021-09-13 14:26:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:26:10,823 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:26:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:10,823 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:26:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2021-09-13 14:26:10,824 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:26:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2021-09-13 14:26:10,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2021-09-13 14:26:11,382 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:26:11,383 INFO L225 Difference]: With dead ends: 97 [2021-09-13 14:26:11,383 INFO L226 Difference]: Without dead ends: 93 [2021-09-13 14:26:11,384 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 500.83ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:26:11,384 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6351.64ms 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, 6353.91ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:11,384 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 44 Unchecked, 6353.91ms Time] [2021-09-13 14:26:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-13 14:26:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-09-13 14:26:11,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:11,482 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:26:11,483 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:26:11,484 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:26:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:11,486 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2021-09-13 14:26:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:26:11,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:11,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:11,486 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:26:11,492 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:26:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:11,493 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2021-09-13 14:26:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:26:11,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:11,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:11,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:11,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:11,494 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:26:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2021-09-13 14:26:11,496 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 19 [2021-09-13 14:26:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:11,496 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2021-09-13 14:26:11,498 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:26:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:26:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:26:11,498 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:11,498 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:11,513 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:26:11,711 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:26:11,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:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -367893245, now seen corresponding path program 1 times [2021-09-13 14:26:11,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:26:11,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618448609] [2021-09-13 14:26:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:11,712 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:26:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:26:11,713 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:26:11,715 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:26:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:11,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:26:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:11,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:13,151 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:26:13,152 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:26:13,152 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:26:13,153 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:26:13,154 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:26:13,155 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:26:13,156 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:26:13,156 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, 100bv32);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:26:13,157 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:26:13,157 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:26:13,158 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, 100bv32);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:26:13,158 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:26:13,159 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:26:13,160 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, 100bv32);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:26:13,160 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:26:13,161 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:26:13,161 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:26:13,162 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:26:13,162 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:26:13,162 INFO L281 TraceCheckUtils]: 19: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2021-09-13 14:26:13,162 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:13,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:16,413 INFO L281 TraceCheckUtils]: 19: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2021-09-13 14:26:16,414 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:26:16,414 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:26:16,414 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:26:16,415 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:26:16,415 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:26:16,415 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, 100bv32);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:26:16,416 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:26:16,416 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:26:16,416 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, 100bv32);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:26:16,417 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:26:16,417 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:26:16,417 INFO L281 TraceCheckUtils]: 7: Hoare triple {3767#true} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {3767#true} is VALID [2021-09-13 14:26:16,417 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:26:16,417 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:26:16,417 INFO L281 TraceCheckUtils]: 4: Hoare triple {3767#true} assume !(0bv32 == assume_abort_if_not_~cond); {3767#true} is VALID [2021-09-13 14:26:16,417 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:26:16,418 INFO L281 TraceCheckUtils]: 2: Hoare triple {3767#true} assume !(0bv32 == assume_abort_if_not_~cond); {3767#true} is VALID [2021-09-13 14:26:16,418 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:26:16,418 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:26:16,418 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:16,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:26:16,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618448609] [2021-09-13 14:26:16,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618448609] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:16,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:16,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 4] imperfect sequences [] total 11 [2021-09-13 14:26:16,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000677454] [2021-09-13 14:26:16,419 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:26:16,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:16,419 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:26:16,948 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:26:16,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:26:16,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:26:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:26:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:26:16,948 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:26:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:49,621 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2021-09-13 14:26:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:26:49,621 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:26:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:49,621 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:26:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2021-09-13 14:26:49,622 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:26:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2021-09-13 14:26:49,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 81 transitions. [2021-09-13 14:26:50,742 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:26:50,743 INFO L225 Difference]: With dead ends: 120 [2021-09-13 14:26:50,744 INFO L226 Difference]: Without dead ends: 118 [2021-09-13 14:26:50,744 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2129.57ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:26:50,744 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13283.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.57ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 13286.83ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:50,744 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 2.57ms Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 45 Unchecked, 13286.83ms Time] [2021-09-13 14:26:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-09-13 14:26:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2021-09-13 14:26:50,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:50,839 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:26:50,839 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:26:50,839 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:26:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:50,841 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-09-13 14:26:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2021-09-13 14:26:50,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:50,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:50,842 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:26:50,842 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:26:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:50,843 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-09-13 14:26:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2021-09-13 14:26:50,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:50,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:50,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:50,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:50,844 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:26:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2021-09-13 14:26:50,845 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 20 [2021-09-13 14:26:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:50,846 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2021-09-13 14:26:50,846 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:26:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2021-09-13 14:26:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:26:50,846 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:50,846 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:50,871 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:26:51,058 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:26:51,059 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:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1357932506, now seen corresponding path program 1 times [2021-09-13 14:26:51,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:26:51,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713083252] [2021-09-13 14:26:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:51,060 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:26:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:26:51,061 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:26:51,063 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:26:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:51,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:26:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:51,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:51,967 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:26:51,967 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:26:51,967 INFO L281 TraceCheckUtils]: 2: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:26:51,968 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:26:51,969 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:26:51,970 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:26:51,970 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:26:51,970 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, 100bv32);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:26:51,971 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:26:51,971 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:26:51,971 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, 100bv32);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:26:51,972 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:26:51,972 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:26:51,973 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, 100bv32);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:26:51,973 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:26:51,973 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:26:51,974 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:26:51,974 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:26:51,975 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:26:51,975 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:26:51,975 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:26:51,976 INFO L281 TraceCheckUtils]: 21: Hoare triple {4434#false} assume !false; {4434#false} is VALID [2021-09-13 14:26:51,976 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:51,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:54,973 INFO L281 TraceCheckUtils]: 21: Hoare triple {4434#false} assume !false; {4434#false} is VALID [2021-09-13 14:26:54,974 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:26:54,974 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:26:54,974 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:26:54,975 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:26:54,975 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:26:54,975 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:26:54,975 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:26:54,976 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, 100bv32);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:26:54,976 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:26:54,976 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:26:54,976 INFO L281 TraceCheckUtils]: 10: Hoare triple {4433#true} assume !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10; {4433#true} is VALID [2021-09-13 14:26:54,976 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:26:54,977 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:26:54,977 INFO L281 TraceCheckUtils]: 7: Hoare triple {4433#true} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {4433#true} is VALID [2021-09-13 14:26:54,977 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:26:54,977 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:26:54,977 INFO L281 TraceCheckUtils]: 4: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:26:54,977 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:26:54,977 INFO L281 TraceCheckUtils]: 2: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:26:54,977 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:26:54,977 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:26:54,977 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:54,977 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:26:54,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713083252] [2021-09-13 14:26:54,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713083252] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:54,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:54,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2021-09-13 14:26:54,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426172552] [2021-09-13 14:26:54,978 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:26:54,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:54,978 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:26:55,524 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:26:55,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:26:55,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:26:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:26:55,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:26:55,525 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:27:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:18,598 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2021-09-13 14:27:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:27:18,598 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:27:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:18,598 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:27:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2021-09-13 14:27:18,599 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:27:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2021-09-13 14:27:18,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 86 transitions. [2021-09-13 14:27:19,613 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:27:19,615 INFO L225 Difference]: With dead ends: 137 [2021-09-13 14:27:19,615 INFO L226 Difference]: Without dead ends: 135 [2021-09-13 14:27:19,615 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1115.11ms TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:27:19,615 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9964.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.71ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 9966.55ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:19,615 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 1.71ms Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 63 Unchecked, 9966.55ms Time] [2021-09-13 14:27:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-09-13 14:27:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2021-09-13 14:27:19,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:19,736 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:27:19,736 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:27:19,737 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:27:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:19,738 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2021-09-13 14:27:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2021-09-13 14:27:19,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:19,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:19,738 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:27:19,739 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:27:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:19,740 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2021-09-13 14:27:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2021-09-13 14:27:19,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:19,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:19,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:19,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:19,741 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:27:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2021-09-13 14:27:19,742 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 22 [2021-09-13 14:27:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:19,742 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2021-09-13 14:27:19,742 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:27:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2021-09-13 14:27:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:27:19,742 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:19,743 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:27:19,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-09-13 14:27:19,943 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:27:19,943 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:27:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1235592658, now seen corresponding path program 1 times [2021-09-13 14:27:19,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:27:19,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954016332] [2021-09-13 14:27:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:19,944 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:27:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:27:19,945 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:27:19,978 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:27:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:20,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:27:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:20,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:21,369 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:27:21,371 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:27:21,371 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:27:21,372 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:27:21,372 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:27:21,373 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:27:21,373 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:27:21,374 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, 100bv32);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:27:21,374 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:27:21,375 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:27:21,375 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, 100bv32);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:27:21,375 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:27:21,376 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:27:21,377 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:27:21,377 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, 100bv32);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:27:21,377 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:27:21,378 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:27:21,378 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, 100bv32);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:27:21,379 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:27:21,379 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:27:21,380 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, 100bv32);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:27:21,380 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:27:21,380 INFO L281 TraceCheckUtils]: 22: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2021-09-13 14:27:21,381 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:27:21,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:34,705 INFO L281 TraceCheckUtils]: 22: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2021-09-13 14:27:34,705 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:27:34,705 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, 100bv32);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:27:34,706 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:27:34,706 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:27:34,706 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, 100bv32);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:27:34,707 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:27:34,707 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:27:34,707 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, 100bv32);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:27:34,708 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:27:34,708 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:27:34,708 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:27:34,709 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, 100bv32);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:27:34,709 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:27:34,709 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:27:34,709 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, 100bv32);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:27:34,710 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:27:34,710 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:27:34,710 INFO L281 TraceCheckUtils]: 4: Hoare triple {5190#true} assume !(0bv32 == assume_abort_if_not_~cond); {5190#true} is VALID [2021-09-13 14:27:34,710 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:27:34,710 INFO L281 TraceCheckUtils]: 2: Hoare triple {5190#true} assume !(0bv32 == assume_abort_if_not_~cond); {5190#true} is VALID [2021-09-13 14:27:34,710 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:27:34,711 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:27:34,711 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:27:34,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:27:34,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954016332] [2021-09-13 14:27:34,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954016332] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:34,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:34,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-09-13 14:27:34,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389678832] [2021-09-13 14:27:34,711 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:27:34,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:34,712 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:27:35,657 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:27:35,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:27:35,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:27:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:27:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:27:35,657 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:28:14,803 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:28:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:28:14,844 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 13216.86ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:28:14,844 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16758.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.38ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16760.61ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:14,844 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 1.38ms Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 16760.61ms Time] [2021-09-13 14:28:14,858 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:28:15,045 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:28:15,046 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@33953e69 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:15,048 INFO L158 Benchmark]: Toolchain (without parser) took 348850.81ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 34.8MB in the end (delta: 999.7kB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2021-09-13 14:28:15,048 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:15,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.36ms. Allocated memory is still 56.6MB. Free memory was 35.6MB in the beginning and 38.5MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:28:15,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.31ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 36.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:28:15,048 INFO L158 Benchmark]: Boogie Preprocessor took 29.76ms. Allocated memory is still 56.6MB. Free memory was 36.6MB in the beginning and 35.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:15,048 INFO L158 Benchmark]: RCFGBuilder took 3964.93ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 51.2MB in the end (delta: -16.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-09-13 14:28:15,048 INFO L158 Benchmark]: TraceAbstraction took 344219.07ms. Allocated memory is still 71.3MB. Free memory was 50.6MB in the beginning and 34.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2021-09-13 14:28:15,049 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.14ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.36ms. Allocated memory is still 56.6MB. Free memory was 35.6MB in the beginning and 38.5MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.31ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 36.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.76ms. Allocated memory is still 56.6MB. Free memory was 36.6MB in the beginning and 35.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 3964.93ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 51.2MB in the end (delta: -16.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 344219.07ms. Allocated memory is still 71.3MB. Free memory was 50.6MB in the beginning and 34.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.0MB. 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@33953e69 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@33953e69: 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:15,102 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...