./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8205221af56d42ab3d3bf56969ff928ae209501 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:28:17,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:28:17,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:28:17,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:28:17,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:28:17,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:28:17,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:28:17,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:28:17,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:28:17,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:28:17,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:28:17,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:28:17,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:28:17,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:28:17,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:28:17,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:28:17,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:28:17,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:28:17,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:28:17,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:28:17,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:28:17,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:28:17,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:28:17,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:28:17,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:28:17,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:28:17,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:28:17,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:28:17,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:28:17,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:28:17,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:28:17,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:28:17,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:28:17,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:28:17,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:28:17,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:28:17,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:28:17,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:28:17,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:28:17,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:28:17,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:28:17,107 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:28:17,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:28:17,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:28:17,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:28:17,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:28:17,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:28:17,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:28:17,125 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:28:17,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:28:17,125 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:28:17,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:28:17,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:28:17,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:28:17,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:28:17,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:28:17,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:28:17,126 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:28:17,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:28:17,135 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:28:17,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:28:17,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:28:17,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:28:17,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:28:17,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:28:17,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:28:17,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:28:17,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:28:17,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:28:17,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:28:17,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:28:17,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:28:17,137 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 -> a8205221af56d42ab3d3bf56969ff928ae209501 [2021-09-13 14:28:17,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:28:17,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:28:17,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:28:17,419 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:28:17,420 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:28:17,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2021-09-13 14:28:17,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6533852/ecfdbe33b7b64ee4a079cac1195f4b20/FLAGdf0d15de2 [2021-09-13 14:28:17,807 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:28:17,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2021-09-13 14:28:17,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6533852/ecfdbe33b7b64ee4a079cac1195f4b20/FLAGdf0d15de2 [2021-09-13 14:28:18,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6533852/ecfdbe33b7b64ee4a079cac1195f4b20 [2021-09-13 14:28:18,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:28:18,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:28:18,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:28:18,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:28:18,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:28:18,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5965bc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18, skipping insertion in model container [2021-09-13 14:28:18,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:28:18,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:28:18,350 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/fermat2-ll_unwindbound50.c[524,537] [2021-09-13 14:28:18,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:28:18,366 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:28:18,373 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/fermat2-ll_unwindbound50.c[524,537] [2021-09-13 14:28:18,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:28:18,392 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:28:18,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18 WrapperNode [2021-09-13 14:28:18,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:28:18,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:28:18,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:28:18,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:28:18,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:28:18,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:28:18,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:28:18,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:28:18,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:28:18,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:28:18,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:28:18,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:28:18,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (1/1) ... [2021-09-13 14:28:18,491 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:28:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:18,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:28:18,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:28:18,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:28:18,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:28:18,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:28:18,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:28:18,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:28:18,775 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-09-13 14:28:18,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:28:18 BoogieIcfgContainer [2021-09-13 14:28:18,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:28:18,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:28:18,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:28:18,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:28:18,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:28:18" (1/3) ... [2021-09-13 14:28:18,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c9d99a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:28:18, skipping insertion in model container [2021-09-13 14:28:18,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:28:18" (2/3) ... [2021-09-13 14:28:18,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c9d99a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:28:18, skipping insertion in model container [2021-09-13 14:28:18,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:28:18" (3/3) ... [2021-09-13 14:28:18,781 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2021-09-13 14:28:18,784 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:28:18,784 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-13 14:28:18,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:28:18,816 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:28:18,816 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-09-13 14:28:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 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:28:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:28:18,828 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:18,829 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:18,829 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1235340721, now seen corresponding path program 1 times [2021-09-13 14:28:18,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:18,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072765817] [2021-09-13 14:28:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:18,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:18,903 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:18,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167695676] [2021-09-13 14:28:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:18,904 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:18,906 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:28:18,958 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:28:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:18,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:28:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:18,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:19,067 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {24#true} is VALID [2021-09-13 14:28:19,068 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 14:28:19,074 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 14:28:19,074 INFO L281 TraceCheckUtils]: 3: Hoare triple {25#false} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {25#false} is VALID [2021-09-13 14:28:19,076 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 14:28:19,077 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {25#false} is VALID [2021-09-13 14:28:19,077 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} assume !true; {25#false} is VALID [2021-09-13 14:28:19,077 INFO L281 TraceCheckUtils]: 7: Hoare triple {25#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 14:28:19,078 INFO L281 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 14:28:19,078 INFO L281 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 14:28:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:19,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:28:19,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:19,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072765817] [2021-09-13 14:28:19,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:19,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167695676] [2021-09-13 14:28:19,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167695676] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:19,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:19,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:28:19,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064889280] [2021-09-13 14:28:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:28:19,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:19,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:19,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:28:19,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:19,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:28:19,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:28:19,144 INFO L87 Difference]: Start difference. First operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:19,224 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2021-09-13 14:28:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:28:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:28:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 14:28:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 14:28:19,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2021-09-13 14:28:19,271 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:28:19,276 INFO L225 Difference]: With dead ends: 39 [2021-09-13 14:28:19,277 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:28:19,279 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.07ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:28:19,281 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.67ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:19,282 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 23 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 26.67ms Time] [2021-09-13 14:28:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:28:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 14:28:19,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:19,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,302 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,302 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:19,303 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 14:28:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:28:19,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:19,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:19,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 14:28:19,305 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 14:28:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:19,306 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 14:28:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:28:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:19,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:19,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:19,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-09-13 14:28:19,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2021-09-13 14:28:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:19,309 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-09-13 14:28:19,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:28:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:28:19,310 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:19,310 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:19,331 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:28:19,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-09-13 14:28:19,527 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1988288018, now seen corresponding path program 1 times [2021-09-13 14:28:19,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:19,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378457263] [2021-09-13 14:28:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:19,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:19,538 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:19,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99437139] [2021-09-13 14:28:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:19,539 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:19,569 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:28:19,610 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:28:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:19,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:28:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:19,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:20,067 INFO L281 TraceCheckUtils]: 0: Hoare triple {155#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {155#true} is VALID [2021-09-13 14:28:20,068 INFO L281 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {155#true} is VALID [2021-09-13 14:28:20,068 INFO L281 TraceCheckUtils]: 2: Hoare triple {155#true} assume !(0 == assume_abort_if_not_~cond); {155#true} is VALID [2021-09-13 14:28:20,068 INFO L281 TraceCheckUtils]: 3: Hoare triple {155#true} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {155#true} is VALID [2021-09-13 14:28:20,068 INFO L281 TraceCheckUtils]: 4: Hoare triple {155#true} assume !(0 == assume_abort_if_not_~cond); {155#true} is VALID [2021-09-13 14:28:21,758 INFO L281 TraceCheckUtils]: 5: Hoare triple {155#true} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} is VALID [2021-09-13 14:28:21,759 INFO L281 TraceCheckUtils]: 6: Hoare triple {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} is VALID [2021-09-13 14:28:22,568 INFO L281 TraceCheckUtils]: 7: Hoare triple {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {182#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:28:22,569 INFO L281 TraceCheckUtils]: 8: Hoare triple {182#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {156#false} is VALID [2021-09-13 14:28:22,569 INFO L281 TraceCheckUtils]: 9: Hoare triple {156#false} assume !false; {156#false} is VALID [2021-09-13 14:28:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:22,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:28:22,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:22,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378457263] [2021-09-13 14:28:22,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:22,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99437139] [2021-09-13 14:28:22,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99437139] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:22,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:22,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:28:22,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17155807] [2021-09-13 14:28:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:28:22,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:22,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:25,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 9 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:25,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:28:25,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:28:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:28:25,814 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:28,599 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-09-13 14:28:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:28:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:28:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-09-13 14:28:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-09-13 14:28:28,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2021-09-13 14:28:31,824 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:28:31,826 INFO L225 Difference]: With dead ends: 34 [2021-09-13 14:28:31,826 INFO L226 Difference]: Without dead ends: 32 [2021-09-13 14:28:31,826 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.42ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:28:31,827 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 867.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.97ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 869.39ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:31,827 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.97ms Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 869.39ms Time] [2021-09-13 14:28:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-09-13 14:28:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2021-09-13 14:28:31,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:31,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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:31,838 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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:31,839 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:31,840 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-09-13 14:28:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-09-13 14:28:31,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:31,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:31,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 32 states. [2021-09-13 14:28:31,841 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 32 states. [2021-09-13 14:28:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:31,842 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-09-13 14:28:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-09-13 14:28:31,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:31,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:31,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:31,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call 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:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-09-13 14:28:31,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2021-09-13 14:28:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:31,843 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-09-13 14:28:31,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-09-13 14:28:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:28:31,844 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:31,844 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:31,856 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:28:32,044 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,SelfDestructingSolverStorable1 [2021-09-13 14:28:32,045 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1507424085, now seen corresponding path program 1 times [2021-09-13 14:28:32,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:32,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406116244] [2021-09-13 14:28:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:32,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:32,055 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:32,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171876508] [2021-09-13 14:28:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:32,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:32,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:32,073 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:28:32,128 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:28:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:32,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:28:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:32,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:32,223 INFO L281 TraceCheckUtils]: 0: Hoare triple {320#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:32,224 INFO L281 TraceCheckUtils]: 1: Hoare triple {325#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:32,225 INFO L281 TraceCheckUtils]: 2: Hoare triple {325#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:32,225 INFO L281 TraceCheckUtils]: 3: Hoare triple {325#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:32,226 INFO L281 TraceCheckUtils]: 4: Hoare triple {325#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:32,226 INFO L281 TraceCheckUtils]: 5: Hoare triple {325#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:32,227 INFO L281 TraceCheckUtils]: 6: Hoare triple {325#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {344#(<= |ULTIMATE.start_main_#t~post9| 0)} is VALID [2021-09-13 14:28:32,228 INFO L281 TraceCheckUtils]: 7: Hoare triple {344#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {321#false} is VALID [2021-09-13 14:28:32,229 INFO L281 TraceCheckUtils]: 8: Hoare triple {321#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {321#false} is VALID [2021-09-13 14:28:32,230 INFO L281 TraceCheckUtils]: 9: Hoare triple {321#false} assume 0 == __VERIFIER_assert_~cond; {321#false} is VALID [2021-09-13 14:28:32,230 INFO L281 TraceCheckUtils]: 10: Hoare triple {321#false} assume !false; {321#false} is VALID [2021-09-13 14:28:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:32,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:28:32,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:32,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406116244] [2021-09-13 14:28:32,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:32,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171876508] [2021-09-13 14:28:32,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171876508] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:32,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:32,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:28:32,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132395966] [2021-09-13 14:28:32,235 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:28:32,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:32,236 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:28:32,251 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:28:32,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:28:32,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:28:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:28:32,252 INFO L87 Difference]: Start difference. First operand 22 states and 27 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:28:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:32,338 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2021-09-13 14:28:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:28:32,339 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:28:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:32,339 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:28:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2021-09-13 14:28:32,342 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:28:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2021-09-13 14:28:32,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2021-09-13 14:28:32,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:32,359 INFO L225 Difference]: With dead ends: 28 [2021-09-13 14:28:32,360 INFO L226 Difference]: Without dead ends: 24 [2021-09-13 14:28:32,360 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.19ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:28:32,361 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:32,361 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 44.35ms Time] [2021-09-13 14:28:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-09-13 14:28:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-09-13 14:28:32,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:32,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:32,371 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:32,371 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:32,372 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-09-13 14:28:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-09-13 14:28:32,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:32,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:32,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2021-09-13 14:28:32,373 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2021-09-13 14:28:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:32,374 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-09-13 14:28:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-09-13 14:28:32,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:32,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:32,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:32,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-09-13 14:28:32,375 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 11 [2021-09-13 14:28:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:32,376 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-09-13 14:28:32,376 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:28:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-09-13 14:28:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:28:32,376 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:32,376 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:32,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-09-13 14:28:32,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:32,588 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1189458428, now seen corresponding path program 1 times [2021-09-13 14:28:32,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:32,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650114084] [2021-09-13 14:28:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:32,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:32,602 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:32,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838028480] [2021-09-13 14:28:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:32,616 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:32,625 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:28:32,640 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:28:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:32,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:28:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:32,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:32,824 INFO L281 TraceCheckUtils]: 0: Hoare triple {466#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {466#true} is VALID [2021-09-13 14:28:32,824 INFO L281 TraceCheckUtils]: 1: Hoare triple {466#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {466#true} is VALID [2021-09-13 14:28:32,825 INFO L281 TraceCheckUtils]: 2: Hoare triple {466#true} assume !(0 == assume_abort_if_not_~cond); {466#true} is VALID [2021-09-13 14:28:32,825 INFO L281 TraceCheckUtils]: 3: Hoare triple {466#true} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {466#true} is VALID [2021-09-13 14:28:32,825 INFO L281 TraceCheckUtils]: 4: Hoare triple {466#true} assume !(0 == assume_abort_if_not_~cond); {466#true} is VALID [2021-09-13 14:28:32,825 INFO L281 TraceCheckUtils]: 5: Hoare triple {466#true} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {466#true} is VALID [2021-09-13 14:28:32,825 INFO L281 TraceCheckUtils]: 6: Hoare triple {466#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {466#true} is VALID [2021-09-13 14:28:32,826 INFO L281 TraceCheckUtils]: 7: Hoare triple {466#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {492#(or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0))))))} is VALID [2021-09-13 14:28:32,826 INFO L281 TraceCheckUtils]: 8: Hoare triple {492#(or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0))))))} assume !(0 == __VERIFIER_assert_~cond); {496#(= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:28:32,827 INFO L281 TraceCheckUtils]: 9: Hoare triple {496#(= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))} assume !(0 != main_~r~0); {500#(= (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)) (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:28:32,827 INFO L281 TraceCheckUtils]: 10: Hoare triple {500#(= (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)) (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {504#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:28:32,828 INFO L281 TraceCheckUtils]: 11: Hoare triple {504#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {467#false} is VALID [2021-09-13 14:28:32,828 INFO L281 TraceCheckUtils]: 12: Hoare triple {467#false} assume !false; {467#false} is VALID [2021-09-13 14:28:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:32,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:28:32,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:32,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650114084] [2021-09-13 14:28:32,829 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:32,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838028480] [2021-09-13 14:28:32,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838028480] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:32,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:32,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:28:32,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784211194] [2021-09-13 14:28:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-13 14:28:32,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:32,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:32,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:32,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:28:32,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:28:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:28:32,839 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:33,113 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-09-13 14:28:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:28:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-13 14:28:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2021-09-13 14:28:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2021-09-13 14:28:33,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2021-09-13 14:28:33,136 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:28:33,136 INFO L225 Difference]: With dead ends: 28 [2021-09-13 14:28:33,137 INFO L226 Difference]: Without dead ends: 22 [2021-09-13 14:28:33,137 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.65ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:28:33,137 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 108.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 109.43ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:33,138 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 109.43ms Time] [2021-09-13 14:28:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-09-13 14:28:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2021-09-13 14:28:33,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:33,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,147 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,147 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:33,148 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-09-13 14:28:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-09-13 14:28:33,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:33,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:33,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 22 states. [2021-09-13 14:28:33,148 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 22 states. [2021-09-13 14:28:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:33,149 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-09-13 14:28:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-09-13 14:28:33,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:33,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:33,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:33,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-09-13 14:28:33,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-09-13 14:28:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:33,150 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-09-13 14:28:33,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-09-13 14:28:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:28:33,150 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:33,150 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:33,185 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:28:33,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:33,351 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -132612007, now seen corresponding path program 1 times [2021-09-13 14:28:33,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:33,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605203442] [2021-09-13 14:28:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:33,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:33,363 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:33,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870489063] [2021-09-13 14:28:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:33,364 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:33,365 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:28:33,366 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:28:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:33,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:28:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:33,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:33,497 INFO L281 TraceCheckUtils]: 0: Hoare triple {612#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:33,497 INFO L281 TraceCheckUtils]: 1: Hoare triple {617#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:33,498 INFO L281 TraceCheckUtils]: 2: Hoare triple {617#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:33,498 INFO L281 TraceCheckUtils]: 3: Hoare triple {617#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:33,498 INFO L281 TraceCheckUtils]: 4: Hoare triple {617#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:33,499 INFO L281 TraceCheckUtils]: 5: Hoare triple {617#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:33,499 INFO L281 TraceCheckUtils]: 6: Hoare triple {617#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:33,500 INFO L281 TraceCheckUtils]: 7: Hoare triple {636#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:33,500 INFO L281 TraceCheckUtils]: 8: Hoare triple {636#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:33,500 INFO L281 TraceCheckUtils]: 9: Hoare triple {636#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:33,501 INFO L281 TraceCheckUtils]: 10: Hoare triple {636#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:33,501 INFO L281 TraceCheckUtils]: 11: Hoare triple {636#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {652#(<= |ULTIMATE.start_main_#t~post9| 1)} is VALID [2021-09-13 14:28:33,502 INFO L281 TraceCheckUtils]: 12: Hoare triple {652#(<= |ULTIMATE.start_main_#t~post9| 1)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {613#false} is VALID [2021-09-13 14:28:33,502 INFO L281 TraceCheckUtils]: 13: Hoare triple {613#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {613#false} is VALID [2021-09-13 14:28:33,502 INFO L281 TraceCheckUtils]: 14: Hoare triple {613#false} assume 0 == __VERIFIER_assert_~cond; {613#false} is VALID [2021-09-13 14:28:33,502 INFO L281 TraceCheckUtils]: 15: Hoare triple {613#false} assume !false; {613#false} is VALID [2021-09-13 14:28:33,502 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:28:33,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:33,620 INFO L281 TraceCheckUtils]: 15: Hoare triple {613#false} assume !false; {613#false} is VALID [2021-09-13 14:28:33,620 INFO L281 TraceCheckUtils]: 14: Hoare triple {613#false} assume 0 == __VERIFIER_assert_~cond; {613#false} is VALID [2021-09-13 14:28:33,621 INFO L281 TraceCheckUtils]: 13: Hoare triple {613#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {613#false} is VALID [2021-09-13 14:28:33,621 INFO L281 TraceCheckUtils]: 12: Hoare triple {674#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {613#false} is VALID [2021-09-13 14:28:33,621 INFO L281 TraceCheckUtils]: 11: Hoare triple {678#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {674#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:28:33,622 INFO L281 TraceCheckUtils]: 10: Hoare triple {678#(< ~counter~0 50)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {678#(< ~counter~0 50)} is VALID [2021-09-13 14:28:33,622 INFO L281 TraceCheckUtils]: 9: Hoare triple {678#(< ~counter~0 50)} assume !!(0 != main_~r~0); {678#(< ~counter~0 50)} is VALID [2021-09-13 14:28:33,622 INFO L281 TraceCheckUtils]: 8: Hoare triple {678#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {678#(< ~counter~0 50)} is VALID [2021-09-13 14:28:33,623 INFO L281 TraceCheckUtils]: 7: Hoare triple {678#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {678#(< ~counter~0 50)} is VALID [2021-09-13 14:28:33,623 INFO L281 TraceCheckUtils]: 6: Hoare triple {694#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {678#(< ~counter~0 50)} is VALID [2021-09-13 14:28:33,624 INFO L281 TraceCheckUtils]: 5: Hoare triple {694#(< ~counter~0 49)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {694#(< ~counter~0 49)} is VALID [2021-09-13 14:28:33,624 INFO L281 TraceCheckUtils]: 4: Hoare triple {694#(< ~counter~0 49)} assume !(0 == assume_abort_if_not_~cond); {694#(< ~counter~0 49)} is VALID [2021-09-13 14:28:33,624 INFO L281 TraceCheckUtils]: 3: Hoare triple {694#(< ~counter~0 49)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {694#(< ~counter~0 49)} is VALID [2021-09-13 14:28:33,625 INFO L281 TraceCheckUtils]: 2: Hoare triple {694#(< ~counter~0 49)} assume !(0 == assume_abort_if_not_~cond); {694#(< ~counter~0 49)} is VALID [2021-09-13 14:28:33,625 INFO L281 TraceCheckUtils]: 1: Hoare triple {694#(< ~counter~0 49)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {694#(< ~counter~0 49)} is VALID [2021-09-13 14:28:33,626 INFO L281 TraceCheckUtils]: 0: Hoare triple {612#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {694#(< ~counter~0 49)} is VALID [2021-09-13 14:28:33,626 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:28:33,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:33,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605203442] [2021-09-13 14:28:33,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:33,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870489063] [2021-09-13 14:28:33,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870489063] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:33,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:33,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-09-13 14:28:33,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229691371] [2021-09-13 14:28:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 14:28:33,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:33,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:33,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:28:33,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:28:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:28:33,649 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:33,798 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2021-09-13 14:28:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:28:33,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 14:28:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2021-09-13 14:28:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2021-09-13 14:28:33,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2021-09-13 14:28:33,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:33,828 INFO L225 Difference]: With dead ends: 36 [2021-09-13 14:28:33,828 INFO L226 Difference]: Without dead ends: 32 [2021-09-13 14:28:33,829 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 40.26ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:28:33,829 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.84ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:33,829 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 48.84ms Time] [2021-09-13 14:28:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-09-13 14:28:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-09-13 14:28:33,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:33,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:28:33,857 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:28:33,857 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:28:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:33,858 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-09-13 14:28:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 14:28:33,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:33,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:33,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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) Second operand 32 states. [2021-09-13 14:28:33,859 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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) Second operand 32 states. [2021-09-13 14:28:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:33,860 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-09-13 14:28:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 14:28:33,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:33,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:33,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:33,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:28:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-09-13 14:28:33,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2021-09-13 14:28:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:33,862 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-09-13 14:28:33,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 14:28:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:28:33,862 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:33,863 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:33,879 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:28:34,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:34,079 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1955278293, now seen corresponding path program 2 times [2021-09-13 14:28:34,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:34,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105149299] [2021-09-13 14:28:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:34,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:34,086 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:34,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016881447] [2021-09-13 14:28:34,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:28:34,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:34,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:34,087 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:28:34,088 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:28:34,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:28:34,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:28:34,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:28:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:34,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:34,376 INFO L281 TraceCheckUtils]: 0: Hoare triple {868#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:34,377 INFO L281 TraceCheckUtils]: 1: Hoare triple {873#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:34,377 INFO L281 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:34,377 INFO L281 TraceCheckUtils]: 3: Hoare triple {873#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:34,378 INFO L281 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:34,378 INFO L281 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:34,379 INFO L281 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:34,379 INFO L281 TraceCheckUtils]: 7: Hoare triple {892#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:34,379 INFO L281 TraceCheckUtils]: 8: Hoare triple {892#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:34,380 INFO L281 TraceCheckUtils]: 9: Hoare triple {892#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:34,380 INFO L281 TraceCheckUtils]: 10: Hoare triple {892#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:34,380 INFO L281 TraceCheckUtils]: 11: Hoare triple {892#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:34,381 INFO L281 TraceCheckUtils]: 12: Hoare triple {908#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:34,381 INFO L281 TraceCheckUtils]: 13: Hoare triple {908#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:34,381 INFO L281 TraceCheckUtils]: 14: Hoare triple {908#(<= ~counter~0 2)} assume !!(0 != main_~r~0); {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:34,382 INFO L281 TraceCheckUtils]: 15: Hoare triple {908#(<= ~counter~0 2)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:34,382 INFO L281 TraceCheckUtils]: 16: Hoare triple {908#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:34,383 INFO L281 TraceCheckUtils]: 17: Hoare triple {924#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:34,383 INFO L281 TraceCheckUtils]: 18: Hoare triple {924#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:34,383 INFO L281 TraceCheckUtils]: 19: Hoare triple {924#(<= ~counter~0 3)} assume !!(0 != main_~r~0); {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:34,384 INFO L281 TraceCheckUtils]: 20: Hoare triple {924#(<= ~counter~0 3)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:34,384 INFO L281 TraceCheckUtils]: 21: Hoare triple {924#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:34,384 INFO L281 TraceCheckUtils]: 22: Hoare triple {940#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:34,385 INFO L281 TraceCheckUtils]: 23: Hoare triple {940#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:34,385 INFO L281 TraceCheckUtils]: 24: Hoare triple {940#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:34,385 INFO L281 TraceCheckUtils]: 25: Hoare triple {940#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:34,386 INFO L281 TraceCheckUtils]: 26: Hoare triple {940#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {956#(<= |ULTIMATE.start_main_#t~post9| 4)} is VALID [2021-09-13 14:28:34,386 INFO L281 TraceCheckUtils]: 27: Hoare triple {956#(<= |ULTIMATE.start_main_#t~post9| 4)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {869#false} is VALID [2021-09-13 14:28:34,386 INFO L281 TraceCheckUtils]: 28: Hoare triple {869#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {869#false} is VALID [2021-09-13 14:28:34,387 INFO L281 TraceCheckUtils]: 29: Hoare triple {869#false} assume 0 == __VERIFIER_assert_~cond; {869#false} is VALID [2021-09-13 14:28:34,387 INFO L281 TraceCheckUtils]: 30: Hoare triple {869#false} assume !false; {869#false} is VALID [2021-09-13 14:28:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:34,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:34,664 INFO L281 TraceCheckUtils]: 30: Hoare triple {869#false} assume !false; {869#false} is VALID [2021-09-13 14:28:34,664 INFO L281 TraceCheckUtils]: 29: Hoare triple {869#false} assume 0 == __VERIFIER_assert_~cond; {869#false} is VALID [2021-09-13 14:28:34,665 INFO L281 TraceCheckUtils]: 28: Hoare triple {869#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {869#false} is VALID [2021-09-13 14:28:34,665 INFO L281 TraceCheckUtils]: 27: Hoare triple {978#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {869#false} is VALID [2021-09-13 14:28:34,666 INFO L281 TraceCheckUtils]: 26: Hoare triple {982#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {978#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:28:34,666 INFO L281 TraceCheckUtils]: 25: Hoare triple {982#(< ~counter~0 50)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {982#(< ~counter~0 50)} is VALID [2021-09-13 14:28:34,667 INFO L281 TraceCheckUtils]: 24: Hoare triple {982#(< ~counter~0 50)} assume !!(0 != main_~r~0); {982#(< ~counter~0 50)} is VALID [2021-09-13 14:28:34,667 INFO L281 TraceCheckUtils]: 23: Hoare triple {982#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {982#(< ~counter~0 50)} is VALID [2021-09-13 14:28:34,667 INFO L281 TraceCheckUtils]: 22: Hoare triple {982#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {982#(< ~counter~0 50)} is VALID [2021-09-13 14:28:34,668 INFO L281 TraceCheckUtils]: 21: Hoare triple {998#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {982#(< ~counter~0 50)} is VALID [2021-09-13 14:28:34,668 INFO L281 TraceCheckUtils]: 20: Hoare triple {998#(< ~counter~0 49)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {998#(< ~counter~0 49)} is VALID [2021-09-13 14:28:34,669 INFO L281 TraceCheckUtils]: 19: Hoare triple {998#(< ~counter~0 49)} assume !!(0 != main_~r~0); {998#(< ~counter~0 49)} is VALID [2021-09-13 14:28:34,669 INFO L281 TraceCheckUtils]: 18: Hoare triple {998#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {998#(< ~counter~0 49)} is VALID [2021-09-13 14:28:34,669 INFO L281 TraceCheckUtils]: 17: Hoare triple {998#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {998#(< ~counter~0 49)} is VALID [2021-09-13 14:28:34,670 INFO L281 TraceCheckUtils]: 16: Hoare triple {1014#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {998#(< ~counter~0 49)} is VALID [2021-09-13 14:28:34,670 INFO L281 TraceCheckUtils]: 15: Hoare triple {1014#(< ~counter~0 48)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1014#(< ~counter~0 48)} is VALID [2021-09-13 14:28:34,671 INFO L281 TraceCheckUtils]: 14: Hoare triple {1014#(< ~counter~0 48)} assume !!(0 != main_~r~0); {1014#(< ~counter~0 48)} is VALID [2021-09-13 14:28:34,671 INFO L281 TraceCheckUtils]: 13: Hoare triple {1014#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {1014#(< ~counter~0 48)} is VALID [2021-09-13 14:28:34,671 INFO L281 TraceCheckUtils]: 12: Hoare triple {1014#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1014#(< ~counter~0 48)} is VALID [2021-09-13 14:28:34,672 INFO L281 TraceCheckUtils]: 11: Hoare triple {1030#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1014#(< ~counter~0 48)} is VALID [2021-09-13 14:28:34,672 INFO L281 TraceCheckUtils]: 10: Hoare triple {1030#(< ~counter~0 47)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1030#(< ~counter~0 47)} is VALID [2021-09-13 14:28:34,673 INFO L281 TraceCheckUtils]: 9: Hoare triple {1030#(< ~counter~0 47)} assume !!(0 != main_~r~0); {1030#(< ~counter~0 47)} is VALID [2021-09-13 14:28:34,673 INFO L281 TraceCheckUtils]: 8: Hoare triple {1030#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {1030#(< ~counter~0 47)} is VALID [2021-09-13 14:28:34,673 INFO L281 TraceCheckUtils]: 7: Hoare triple {1030#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1030#(< ~counter~0 47)} is VALID [2021-09-13 14:28:34,674 INFO L281 TraceCheckUtils]: 6: Hoare triple {1046#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1030#(< ~counter~0 47)} is VALID [2021-09-13 14:28:34,674 INFO L281 TraceCheckUtils]: 5: Hoare triple {1046#(< ~counter~0 46)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {1046#(< ~counter~0 46)} is VALID [2021-09-13 14:28:34,674 INFO L281 TraceCheckUtils]: 4: Hoare triple {1046#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond); {1046#(< ~counter~0 46)} is VALID [2021-09-13 14:28:34,675 INFO L281 TraceCheckUtils]: 3: Hoare triple {1046#(< ~counter~0 46)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1046#(< ~counter~0 46)} is VALID [2021-09-13 14:28:34,675 INFO L281 TraceCheckUtils]: 2: Hoare triple {1046#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond); {1046#(< ~counter~0 46)} is VALID [2021-09-13 14:28:34,675 INFO L281 TraceCheckUtils]: 1: Hoare triple {1046#(< ~counter~0 46)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1046#(< ~counter~0 46)} is VALID [2021-09-13 14:28:34,676 INFO L281 TraceCheckUtils]: 0: Hoare triple {868#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1046#(< ~counter~0 46)} is VALID [2021-09-13 14:28:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:34,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:34,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105149299] [2021-09-13 14:28:34,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:34,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016881447] [2021-09-13 14:28:34,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016881447] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:34,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:34,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-09-13 14:28:34,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976839674] [2021-09-13 14:28:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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 31 [2021-09-13 14:28:34,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:34,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:28:34,722 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:28:34,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:28:34,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:34,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:28:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:28:34,723 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:28:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:34,995 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2021-09-13 14:28:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-09-13 14:28:34,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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 31 [2021-09-13 14:28:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:28:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2021-09-13 14:28:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:28:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2021-09-13 14:28:34,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 81 transitions. [2021-09-13 14:28:35,050 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:28:35,052 INFO L225 Difference]: With dead ends: 66 [2021-09-13 14:28:35,052 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:28:35,052 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 136.33ms TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-09-13 14:28:35,053 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.07ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.70ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:35,053 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 114 Unknown, 0 Unchecked, 1.07ms Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 64.70ms Time] [2021-09-13 14:28:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:28:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-09-13 14:28:35,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:35,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:35,116 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:35,117 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:35,118 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2021-09-13 14:28:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-09-13 14:28:35,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:35,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:35,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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:28:35,119 INFO L87 Difference]: Start difference. First operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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:28:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:35,120 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2021-09-13 14:28:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-09-13 14:28:35,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:35,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:35,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:35,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-09-13 14:28:35,122 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 31 [2021-09-13 14:28:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:35,123 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-09-13 14:28:35,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 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:28:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-09-13 14:28:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-09-13 14:28:35,124 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:35,124 INFO L513 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:35,142 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:28:35,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:35,340 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1641990037, now seen corresponding path program 3 times [2021-09-13 14:28:35,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:35,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840266662] [2021-09-13 14:28:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:35,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:35,347 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:35,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722251932] [2021-09-13 14:28:35,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:28:35,347 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:35,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:35,350 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:28:35,351 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:28:37,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-09-13 14:28:37,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:28:37,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjunts are in the unsatisfiable core [2021-09-13 14:28:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:37,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:37,594 INFO L281 TraceCheckUtils]: 0: Hoare triple {1376#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:37,595 INFO L281 TraceCheckUtils]: 1: Hoare triple {1381#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:37,595 INFO L281 TraceCheckUtils]: 2: Hoare triple {1381#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:37,595 INFO L281 TraceCheckUtils]: 3: Hoare triple {1381#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:37,596 INFO L281 TraceCheckUtils]: 4: Hoare triple {1381#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:37,596 INFO L281 TraceCheckUtils]: 5: Hoare triple {1381#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:37,596 INFO L281 TraceCheckUtils]: 6: Hoare triple {1381#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:37,597 INFO L281 TraceCheckUtils]: 7: Hoare triple {1400#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:37,597 INFO L281 TraceCheckUtils]: 8: Hoare triple {1400#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:37,597 INFO L281 TraceCheckUtils]: 9: Hoare triple {1400#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:37,598 INFO L281 TraceCheckUtils]: 10: Hoare triple {1400#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:37,598 INFO L281 TraceCheckUtils]: 11: Hoare triple {1400#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:37,599 INFO L281 TraceCheckUtils]: 12: Hoare triple {1416#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:37,599 INFO L281 TraceCheckUtils]: 13: Hoare triple {1416#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:37,599 INFO L281 TraceCheckUtils]: 14: Hoare triple {1416#(<= ~counter~0 2)} assume !!(0 != main_~r~0); {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:37,600 INFO L281 TraceCheckUtils]: 15: Hoare triple {1416#(<= ~counter~0 2)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:37,600 INFO L281 TraceCheckUtils]: 16: Hoare triple {1416#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:37,600 INFO L281 TraceCheckUtils]: 17: Hoare triple {1432#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:37,601 INFO L281 TraceCheckUtils]: 18: Hoare triple {1432#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:37,601 INFO L281 TraceCheckUtils]: 19: Hoare triple {1432#(<= ~counter~0 3)} assume !!(0 != main_~r~0); {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:37,601 INFO L281 TraceCheckUtils]: 20: Hoare triple {1432#(<= ~counter~0 3)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:37,602 INFO L281 TraceCheckUtils]: 21: Hoare triple {1432#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:37,602 INFO L281 TraceCheckUtils]: 22: Hoare triple {1448#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:37,602 INFO L281 TraceCheckUtils]: 23: Hoare triple {1448#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:37,603 INFO L281 TraceCheckUtils]: 24: Hoare triple {1448#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:37,603 INFO L281 TraceCheckUtils]: 25: Hoare triple {1448#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:37,603 INFO L281 TraceCheckUtils]: 26: Hoare triple {1448#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:37,604 INFO L281 TraceCheckUtils]: 27: Hoare triple {1464#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:37,604 INFO L281 TraceCheckUtils]: 28: Hoare triple {1464#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:37,604 INFO L281 TraceCheckUtils]: 29: Hoare triple {1464#(<= ~counter~0 5)} assume !!(0 != main_~r~0); {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:37,605 INFO L281 TraceCheckUtils]: 30: Hoare triple {1464#(<= ~counter~0 5)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:37,605 INFO L281 TraceCheckUtils]: 31: Hoare triple {1464#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:37,606 INFO L281 TraceCheckUtils]: 32: Hoare triple {1480#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:37,606 INFO L281 TraceCheckUtils]: 33: Hoare triple {1480#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:37,606 INFO L281 TraceCheckUtils]: 34: Hoare triple {1480#(<= ~counter~0 6)} assume !!(0 != main_~r~0); {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:37,607 INFO L281 TraceCheckUtils]: 35: Hoare triple {1480#(<= ~counter~0 6)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:37,607 INFO L281 TraceCheckUtils]: 36: Hoare triple {1480#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:37,614 INFO L281 TraceCheckUtils]: 37: Hoare triple {1496#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:37,614 INFO L281 TraceCheckUtils]: 38: Hoare triple {1496#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:37,615 INFO L281 TraceCheckUtils]: 39: Hoare triple {1496#(<= ~counter~0 7)} assume !!(0 != main_~r~0); {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:37,615 INFO L281 TraceCheckUtils]: 40: Hoare triple {1496#(<= ~counter~0 7)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:37,616 INFO L281 TraceCheckUtils]: 41: Hoare triple {1496#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:37,616 INFO L281 TraceCheckUtils]: 42: Hoare triple {1512#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:37,616 INFO L281 TraceCheckUtils]: 43: Hoare triple {1512#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:37,617 INFO L281 TraceCheckUtils]: 44: Hoare triple {1512#(<= ~counter~0 8)} assume !!(0 != main_~r~0); {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:37,617 INFO L281 TraceCheckUtils]: 45: Hoare triple {1512#(<= ~counter~0 8)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:37,617 INFO L281 TraceCheckUtils]: 46: Hoare triple {1512#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:37,618 INFO L281 TraceCheckUtils]: 47: Hoare triple {1528#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:37,618 INFO L281 TraceCheckUtils]: 48: Hoare triple {1528#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:37,618 INFO L281 TraceCheckUtils]: 49: Hoare triple {1528#(<= ~counter~0 9)} assume !!(0 != main_~r~0); {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:37,619 INFO L281 TraceCheckUtils]: 50: Hoare triple {1528#(<= ~counter~0 9)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:37,619 INFO L281 TraceCheckUtils]: 51: Hoare triple {1528#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:37,619 INFO L281 TraceCheckUtils]: 52: Hoare triple {1544#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:37,620 INFO L281 TraceCheckUtils]: 53: Hoare triple {1544#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:37,620 INFO L281 TraceCheckUtils]: 54: Hoare triple {1544#(<= ~counter~0 10)} assume !!(0 != main_~r~0); {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:37,620 INFO L281 TraceCheckUtils]: 55: Hoare triple {1544#(<= ~counter~0 10)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:37,621 INFO L281 TraceCheckUtils]: 56: Hoare triple {1544#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1560#(<= |ULTIMATE.start_main_#t~post9| 10)} is VALID [2021-09-13 14:28:37,621 INFO L281 TraceCheckUtils]: 57: Hoare triple {1560#(<= |ULTIMATE.start_main_#t~post9| 10)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {1377#false} is VALID [2021-09-13 14:28:37,621 INFO L281 TraceCheckUtils]: 58: Hoare triple {1377#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1377#false} is VALID [2021-09-13 14:28:37,621 INFO L281 TraceCheckUtils]: 59: Hoare triple {1377#false} assume 0 == __VERIFIER_assert_~cond; {1377#false} is VALID [2021-09-13 14:28:37,621 INFO L281 TraceCheckUtils]: 60: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2021-09-13 14:28:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:37,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:38,270 INFO L281 TraceCheckUtils]: 60: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2021-09-13 14:28:38,270 INFO L281 TraceCheckUtils]: 59: Hoare triple {1377#false} assume 0 == __VERIFIER_assert_~cond; {1377#false} is VALID [2021-09-13 14:28:38,270 INFO L281 TraceCheckUtils]: 58: Hoare triple {1377#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1377#false} is VALID [2021-09-13 14:28:38,271 INFO L281 TraceCheckUtils]: 57: Hoare triple {1582#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {1377#false} is VALID [2021-09-13 14:28:38,271 INFO L281 TraceCheckUtils]: 56: Hoare triple {1586#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1582#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:28:38,272 INFO L281 TraceCheckUtils]: 55: Hoare triple {1586#(< ~counter~0 50)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1586#(< ~counter~0 50)} is VALID [2021-09-13 14:28:38,272 INFO L281 TraceCheckUtils]: 54: Hoare triple {1586#(< ~counter~0 50)} assume !!(0 != main_~r~0); {1586#(< ~counter~0 50)} is VALID [2021-09-13 14:28:38,272 INFO L281 TraceCheckUtils]: 53: Hoare triple {1586#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {1586#(< ~counter~0 50)} is VALID [2021-09-13 14:28:38,273 INFO L281 TraceCheckUtils]: 52: Hoare triple {1586#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1586#(< ~counter~0 50)} is VALID [2021-09-13 14:28:38,273 INFO L281 TraceCheckUtils]: 51: Hoare triple {1602#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1586#(< ~counter~0 50)} is VALID [2021-09-13 14:28:38,274 INFO L281 TraceCheckUtils]: 50: Hoare triple {1602#(< ~counter~0 49)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1602#(< ~counter~0 49)} is VALID [2021-09-13 14:28:38,274 INFO L281 TraceCheckUtils]: 49: Hoare triple {1602#(< ~counter~0 49)} assume !!(0 != main_~r~0); {1602#(< ~counter~0 49)} is VALID [2021-09-13 14:28:38,274 INFO L281 TraceCheckUtils]: 48: Hoare triple {1602#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {1602#(< ~counter~0 49)} is VALID [2021-09-13 14:28:38,275 INFO L281 TraceCheckUtils]: 47: Hoare triple {1602#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1602#(< ~counter~0 49)} is VALID [2021-09-13 14:28:38,275 INFO L281 TraceCheckUtils]: 46: Hoare triple {1618#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1602#(< ~counter~0 49)} is VALID [2021-09-13 14:28:38,276 INFO L281 TraceCheckUtils]: 45: Hoare triple {1618#(< ~counter~0 48)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1618#(< ~counter~0 48)} is VALID [2021-09-13 14:28:38,276 INFO L281 TraceCheckUtils]: 44: Hoare triple {1618#(< ~counter~0 48)} assume !!(0 != main_~r~0); {1618#(< ~counter~0 48)} is VALID [2021-09-13 14:28:38,276 INFO L281 TraceCheckUtils]: 43: Hoare triple {1618#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {1618#(< ~counter~0 48)} is VALID [2021-09-13 14:28:38,277 INFO L281 TraceCheckUtils]: 42: Hoare triple {1618#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1618#(< ~counter~0 48)} is VALID [2021-09-13 14:28:38,277 INFO L281 TraceCheckUtils]: 41: Hoare triple {1634#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1618#(< ~counter~0 48)} is VALID [2021-09-13 14:28:38,277 INFO L281 TraceCheckUtils]: 40: Hoare triple {1634#(< ~counter~0 47)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1634#(< ~counter~0 47)} is VALID [2021-09-13 14:28:38,278 INFO L281 TraceCheckUtils]: 39: Hoare triple {1634#(< ~counter~0 47)} assume !!(0 != main_~r~0); {1634#(< ~counter~0 47)} is VALID [2021-09-13 14:28:38,278 INFO L281 TraceCheckUtils]: 38: Hoare triple {1634#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {1634#(< ~counter~0 47)} is VALID [2021-09-13 14:28:38,279 INFO L281 TraceCheckUtils]: 37: Hoare triple {1634#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1634#(< ~counter~0 47)} is VALID [2021-09-13 14:28:38,279 INFO L281 TraceCheckUtils]: 36: Hoare triple {1650#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1634#(< ~counter~0 47)} is VALID [2021-09-13 14:28:38,279 INFO L281 TraceCheckUtils]: 35: Hoare triple {1650#(< ~counter~0 46)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1650#(< ~counter~0 46)} is VALID [2021-09-13 14:28:38,280 INFO L281 TraceCheckUtils]: 34: Hoare triple {1650#(< ~counter~0 46)} assume !!(0 != main_~r~0); {1650#(< ~counter~0 46)} is VALID [2021-09-13 14:28:38,280 INFO L281 TraceCheckUtils]: 33: Hoare triple {1650#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {1650#(< ~counter~0 46)} is VALID [2021-09-13 14:28:38,280 INFO L281 TraceCheckUtils]: 32: Hoare triple {1650#(< ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1650#(< ~counter~0 46)} is VALID [2021-09-13 14:28:38,281 INFO L281 TraceCheckUtils]: 31: Hoare triple {1666#(< ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1650#(< ~counter~0 46)} is VALID [2021-09-13 14:28:38,281 INFO L281 TraceCheckUtils]: 30: Hoare triple {1666#(< ~counter~0 45)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1666#(< ~counter~0 45)} is VALID [2021-09-13 14:28:38,282 INFO L281 TraceCheckUtils]: 29: Hoare triple {1666#(< ~counter~0 45)} assume !!(0 != main_~r~0); {1666#(< ~counter~0 45)} is VALID [2021-09-13 14:28:38,282 INFO L281 TraceCheckUtils]: 28: Hoare triple {1666#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {1666#(< ~counter~0 45)} is VALID [2021-09-13 14:28:38,282 INFO L281 TraceCheckUtils]: 27: Hoare triple {1666#(< ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1666#(< ~counter~0 45)} is VALID [2021-09-13 14:28:38,283 INFO L281 TraceCheckUtils]: 26: Hoare triple {1682#(< ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1666#(< ~counter~0 45)} is VALID [2021-09-13 14:28:38,283 INFO L281 TraceCheckUtils]: 25: Hoare triple {1682#(< ~counter~0 44)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1682#(< ~counter~0 44)} is VALID [2021-09-13 14:28:38,283 INFO L281 TraceCheckUtils]: 24: Hoare triple {1682#(< ~counter~0 44)} assume !!(0 != main_~r~0); {1682#(< ~counter~0 44)} is VALID [2021-09-13 14:28:38,284 INFO L281 TraceCheckUtils]: 23: Hoare triple {1682#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {1682#(< ~counter~0 44)} is VALID [2021-09-13 14:28:38,284 INFO L281 TraceCheckUtils]: 22: Hoare triple {1682#(< ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1682#(< ~counter~0 44)} is VALID [2021-09-13 14:28:38,284 INFO L281 TraceCheckUtils]: 21: Hoare triple {1698#(< ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1682#(< ~counter~0 44)} is VALID [2021-09-13 14:28:38,285 INFO L281 TraceCheckUtils]: 20: Hoare triple {1698#(< ~counter~0 43)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1698#(< ~counter~0 43)} is VALID [2021-09-13 14:28:38,285 INFO L281 TraceCheckUtils]: 19: Hoare triple {1698#(< ~counter~0 43)} assume !!(0 != main_~r~0); {1698#(< ~counter~0 43)} is VALID [2021-09-13 14:28:38,285 INFO L281 TraceCheckUtils]: 18: Hoare triple {1698#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {1698#(< ~counter~0 43)} is VALID [2021-09-13 14:28:38,286 INFO L281 TraceCheckUtils]: 17: Hoare triple {1698#(< ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1698#(< ~counter~0 43)} is VALID [2021-09-13 14:28:38,286 INFO L281 TraceCheckUtils]: 16: Hoare triple {1714#(< ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1698#(< ~counter~0 43)} is VALID [2021-09-13 14:28:38,287 INFO L281 TraceCheckUtils]: 15: Hoare triple {1714#(< ~counter~0 42)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1714#(< ~counter~0 42)} is VALID [2021-09-13 14:28:38,287 INFO L281 TraceCheckUtils]: 14: Hoare triple {1714#(< ~counter~0 42)} assume !!(0 != main_~r~0); {1714#(< ~counter~0 42)} is VALID [2021-09-13 14:28:38,287 INFO L281 TraceCheckUtils]: 13: Hoare triple {1714#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {1714#(< ~counter~0 42)} is VALID [2021-09-13 14:28:38,287 INFO L281 TraceCheckUtils]: 12: Hoare triple {1714#(< ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1714#(< ~counter~0 42)} is VALID [2021-09-13 14:28:38,288 INFO L281 TraceCheckUtils]: 11: Hoare triple {1730#(< ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1714#(< ~counter~0 42)} is VALID [2021-09-13 14:28:38,288 INFO L281 TraceCheckUtils]: 10: Hoare triple {1730#(< ~counter~0 41)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1730#(< ~counter~0 41)} is VALID [2021-09-13 14:28:38,289 INFO L281 TraceCheckUtils]: 9: Hoare triple {1730#(< ~counter~0 41)} assume !!(0 != main_~r~0); {1730#(< ~counter~0 41)} is VALID [2021-09-13 14:28:38,289 INFO L281 TraceCheckUtils]: 8: Hoare triple {1730#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {1730#(< ~counter~0 41)} is VALID [2021-09-13 14:28:38,289 INFO L281 TraceCheckUtils]: 7: Hoare triple {1730#(< ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1730#(< ~counter~0 41)} is VALID [2021-09-13 14:28:38,290 INFO L281 TraceCheckUtils]: 6: Hoare triple {1746#(< ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1730#(< ~counter~0 41)} is VALID [2021-09-13 14:28:38,290 INFO L281 TraceCheckUtils]: 5: Hoare triple {1746#(< ~counter~0 40)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {1746#(< ~counter~0 40)} is VALID [2021-09-13 14:28:38,290 INFO L281 TraceCheckUtils]: 4: Hoare triple {1746#(< ~counter~0 40)} assume !(0 == assume_abort_if_not_~cond); {1746#(< ~counter~0 40)} is VALID [2021-09-13 14:28:38,291 INFO L281 TraceCheckUtils]: 3: Hoare triple {1746#(< ~counter~0 40)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1746#(< ~counter~0 40)} is VALID [2021-09-13 14:28:38,291 INFO L281 TraceCheckUtils]: 2: Hoare triple {1746#(< ~counter~0 40)} assume !(0 == assume_abort_if_not_~cond); {1746#(< ~counter~0 40)} is VALID [2021-09-13 14:28:38,291 INFO L281 TraceCheckUtils]: 1: Hoare triple {1746#(< ~counter~0 40)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1746#(< ~counter~0 40)} is VALID [2021-09-13 14:28:38,292 INFO L281 TraceCheckUtils]: 0: Hoare triple {1376#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1746#(< ~counter~0 40)} is VALID [2021-09-13 14:28:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:38,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:38,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840266662] [2021-09-13 14:28:38,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:38,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722251932] [2021-09-13 14:28:38,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722251932] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:38,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:38,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-09-13 14:28:38,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822045231] [2021-09-13 14:28:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 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 61 [2021-09-13 14:28:38,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:38,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:38,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:38,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-09-13 14:28:38,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-09-13 14:28:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-09-13 14:28:38,377 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:39,029 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2021-09-13 14:28:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-09-13 14:28:39,029 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 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 61 [2021-09-13 14:28:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 159 transitions. [2021-09-13 14:28:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 159 transitions. [2021-09-13 14:28:39,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 159 transitions. [2021-09-13 14:28:39,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:39,134 INFO L225 Difference]: With dead ends: 126 [2021-09-13 14:28:39,134 INFO L226 Difference]: Without dead ends: 122 [2021-09-13 14:28:39,135 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 463.66ms TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-09-13 14:28:39,135 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.72ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.23ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:39,136 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 1.72ms Time], IncrementalHoareTripleChecker [25 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 128.23ms Time] [2021-09-13 14:28:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-09-13 14:28:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-09-13 14:28:39,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:39,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 122 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call 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:39,289 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 122 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call 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:39,289 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 122 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call 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:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:39,292 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2021-09-13 14:28:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2021-09-13 14:28:39,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:39,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:39,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 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 122 states. [2021-09-13 14:28:39,303 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 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 122 states. [2021-09-13 14:28:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:39,305 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2021-09-13 14:28:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2021-09-13 14:28:39,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:39,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:39,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:39,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call 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:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2021-09-13 14:28:39,308 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 61 [2021-09-13 14:28:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:39,308 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2021-09-13 14:28:39,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2021-09-13 14:28:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-09-13 14:28:39,312 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:39,312 INFO L513 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:39,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:39,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:39,519 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:39,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash 433108203, now seen corresponding path program 4 times [2021-09-13 14:28:39,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:39,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928385777] [2021-09-13 14:28:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:39,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:39,527 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:39,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148338579] [2021-09-13 14:28:39,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-09-13 14:28:39,528 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:39,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:39,541 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:28:39,577 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:28:39,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-09-13 14:28:39,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:28:39,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 47 conjunts are in the unsatisfiable core [2021-09-13 14:28:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:39,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:40,683 INFO L281 TraceCheckUtils]: 0: Hoare triple {2388#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2393#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:40,683 INFO L281 TraceCheckUtils]: 1: Hoare triple {2393#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2393#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:40,683 INFO L281 TraceCheckUtils]: 2: Hoare triple {2393#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {2393#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:40,684 INFO L281 TraceCheckUtils]: 3: Hoare triple {2393#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2393#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:40,684 INFO L281 TraceCheckUtils]: 4: Hoare triple {2393#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {2393#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:40,684 INFO L281 TraceCheckUtils]: 5: Hoare triple {2393#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {2393#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:40,685 INFO L281 TraceCheckUtils]: 6: Hoare triple {2393#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2412#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:40,686 INFO L281 TraceCheckUtils]: 7: Hoare triple {2412#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2412#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:40,686 INFO L281 TraceCheckUtils]: 8: Hoare triple {2412#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {2412#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:40,686 INFO L281 TraceCheckUtils]: 9: Hoare triple {2412#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {2412#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:40,686 INFO L281 TraceCheckUtils]: 10: Hoare triple {2412#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2412#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:40,687 INFO L281 TraceCheckUtils]: 11: Hoare triple {2412#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2428#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:40,687 INFO L281 TraceCheckUtils]: 12: Hoare triple {2428#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2428#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:40,687 INFO L281 TraceCheckUtils]: 13: Hoare triple {2428#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {2428#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:40,688 INFO L281 TraceCheckUtils]: 14: Hoare triple {2428#(<= ~counter~0 2)} assume !!(0 != main_~r~0); {2428#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:40,688 INFO L281 TraceCheckUtils]: 15: Hoare triple {2428#(<= ~counter~0 2)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2428#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:40,688 INFO L281 TraceCheckUtils]: 16: Hoare triple {2428#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2444#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:40,689 INFO L281 TraceCheckUtils]: 17: Hoare triple {2444#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2444#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:40,689 INFO L281 TraceCheckUtils]: 18: Hoare triple {2444#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {2444#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:40,689 INFO L281 TraceCheckUtils]: 19: Hoare triple {2444#(<= ~counter~0 3)} assume !!(0 != main_~r~0); {2444#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:40,689 INFO L281 TraceCheckUtils]: 20: Hoare triple {2444#(<= ~counter~0 3)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2444#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:40,690 INFO L281 TraceCheckUtils]: 21: Hoare triple {2444#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2460#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:40,690 INFO L281 TraceCheckUtils]: 22: Hoare triple {2460#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2460#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:40,690 INFO L281 TraceCheckUtils]: 23: Hoare triple {2460#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {2460#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:40,691 INFO L281 TraceCheckUtils]: 24: Hoare triple {2460#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {2460#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:40,691 INFO L281 TraceCheckUtils]: 25: Hoare triple {2460#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2460#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:40,692 INFO L281 TraceCheckUtils]: 26: Hoare triple {2460#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2476#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:40,692 INFO L281 TraceCheckUtils]: 27: Hoare triple {2476#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2476#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:40,692 INFO L281 TraceCheckUtils]: 28: Hoare triple {2476#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {2476#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:40,692 INFO L281 TraceCheckUtils]: 29: Hoare triple {2476#(<= ~counter~0 5)} assume !!(0 != main_~r~0); {2476#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:40,693 INFO L281 TraceCheckUtils]: 30: Hoare triple {2476#(<= ~counter~0 5)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2476#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:40,693 INFO L281 TraceCheckUtils]: 31: Hoare triple {2476#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2492#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:40,693 INFO L281 TraceCheckUtils]: 32: Hoare triple {2492#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2492#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:40,694 INFO L281 TraceCheckUtils]: 33: Hoare triple {2492#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {2492#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:40,694 INFO L281 TraceCheckUtils]: 34: Hoare triple {2492#(<= ~counter~0 6)} assume !!(0 != main_~r~0); {2492#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:40,694 INFO L281 TraceCheckUtils]: 35: Hoare triple {2492#(<= ~counter~0 6)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2492#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:40,695 INFO L281 TraceCheckUtils]: 36: Hoare triple {2492#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2508#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:40,695 INFO L281 TraceCheckUtils]: 37: Hoare triple {2508#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2508#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:40,695 INFO L281 TraceCheckUtils]: 38: Hoare triple {2508#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {2508#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:40,695 INFO L281 TraceCheckUtils]: 39: Hoare triple {2508#(<= ~counter~0 7)} assume !!(0 != main_~r~0); {2508#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:40,696 INFO L281 TraceCheckUtils]: 40: Hoare triple {2508#(<= ~counter~0 7)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2508#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:40,696 INFO L281 TraceCheckUtils]: 41: Hoare triple {2508#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2524#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:40,696 INFO L281 TraceCheckUtils]: 42: Hoare triple {2524#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2524#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:40,697 INFO L281 TraceCheckUtils]: 43: Hoare triple {2524#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {2524#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:40,697 INFO L281 TraceCheckUtils]: 44: Hoare triple {2524#(<= ~counter~0 8)} assume !!(0 != main_~r~0); {2524#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:40,697 INFO L281 TraceCheckUtils]: 45: Hoare triple {2524#(<= ~counter~0 8)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2524#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:40,698 INFO L281 TraceCheckUtils]: 46: Hoare triple {2524#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2540#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:40,698 INFO L281 TraceCheckUtils]: 47: Hoare triple {2540#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2540#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:40,699 INFO L281 TraceCheckUtils]: 48: Hoare triple {2540#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {2540#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:40,699 INFO L281 TraceCheckUtils]: 49: Hoare triple {2540#(<= ~counter~0 9)} assume !!(0 != main_~r~0); {2540#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:40,699 INFO L281 TraceCheckUtils]: 50: Hoare triple {2540#(<= ~counter~0 9)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2540#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:40,700 INFO L281 TraceCheckUtils]: 51: Hoare triple {2540#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2556#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:40,700 INFO L281 TraceCheckUtils]: 52: Hoare triple {2556#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2556#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:40,700 INFO L281 TraceCheckUtils]: 53: Hoare triple {2556#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {2556#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:40,700 INFO L281 TraceCheckUtils]: 54: Hoare triple {2556#(<= ~counter~0 10)} assume !!(0 != main_~r~0); {2556#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:40,701 INFO L281 TraceCheckUtils]: 55: Hoare triple {2556#(<= ~counter~0 10)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2556#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:40,701 INFO L281 TraceCheckUtils]: 56: Hoare triple {2556#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2572#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:40,709 INFO L281 TraceCheckUtils]: 57: Hoare triple {2572#(<= ~counter~0 11)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2572#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:40,710 INFO L281 TraceCheckUtils]: 58: Hoare triple {2572#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {2572#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:40,710 INFO L281 TraceCheckUtils]: 59: Hoare triple {2572#(<= ~counter~0 11)} assume !!(0 != main_~r~0); {2572#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:40,710 INFO L281 TraceCheckUtils]: 60: Hoare triple {2572#(<= ~counter~0 11)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2572#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:40,710 INFO L281 TraceCheckUtils]: 61: Hoare triple {2572#(<= ~counter~0 11)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2588#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:40,711 INFO L281 TraceCheckUtils]: 62: Hoare triple {2588#(<= ~counter~0 12)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2588#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:40,711 INFO L281 TraceCheckUtils]: 63: Hoare triple {2588#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {2588#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:40,711 INFO L281 TraceCheckUtils]: 64: Hoare triple {2588#(<= ~counter~0 12)} assume !!(0 != main_~r~0); {2588#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:40,711 INFO L281 TraceCheckUtils]: 65: Hoare triple {2588#(<= ~counter~0 12)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2588#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:40,712 INFO L281 TraceCheckUtils]: 66: Hoare triple {2588#(<= ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2604#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:40,712 INFO L281 TraceCheckUtils]: 67: Hoare triple {2604#(<= ~counter~0 13)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2604#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:40,712 INFO L281 TraceCheckUtils]: 68: Hoare triple {2604#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {2604#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:40,713 INFO L281 TraceCheckUtils]: 69: Hoare triple {2604#(<= ~counter~0 13)} assume !!(0 != main_~r~0); {2604#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:40,713 INFO L281 TraceCheckUtils]: 70: Hoare triple {2604#(<= ~counter~0 13)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2604#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:40,713 INFO L281 TraceCheckUtils]: 71: Hoare triple {2604#(<= ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2620#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:40,714 INFO L281 TraceCheckUtils]: 72: Hoare triple {2620#(<= ~counter~0 14)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2620#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:40,714 INFO L281 TraceCheckUtils]: 73: Hoare triple {2620#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {2620#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:40,714 INFO L281 TraceCheckUtils]: 74: Hoare triple {2620#(<= ~counter~0 14)} assume !!(0 != main_~r~0); {2620#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:40,714 INFO L281 TraceCheckUtils]: 75: Hoare triple {2620#(<= ~counter~0 14)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2620#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:40,715 INFO L281 TraceCheckUtils]: 76: Hoare triple {2620#(<= ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2636#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:40,715 INFO L281 TraceCheckUtils]: 77: Hoare triple {2636#(<= ~counter~0 15)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2636#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:40,715 INFO L281 TraceCheckUtils]: 78: Hoare triple {2636#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {2636#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:40,716 INFO L281 TraceCheckUtils]: 79: Hoare triple {2636#(<= ~counter~0 15)} assume !!(0 != main_~r~0); {2636#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:40,716 INFO L281 TraceCheckUtils]: 80: Hoare triple {2636#(<= ~counter~0 15)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2636#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:40,716 INFO L281 TraceCheckUtils]: 81: Hoare triple {2636#(<= ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2652#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:40,716 INFO L281 TraceCheckUtils]: 82: Hoare triple {2652#(<= ~counter~0 16)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2652#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:40,717 INFO L281 TraceCheckUtils]: 83: Hoare triple {2652#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {2652#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:40,717 INFO L281 TraceCheckUtils]: 84: Hoare triple {2652#(<= ~counter~0 16)} assume !!(0 != main_~r~0); {2652#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:40,717 INFO L281 TraceCheckUtils]: 85: Hoare triple {2652#(<= ~counter~0 16)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2652#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:40,718 INFO L281 TraceCheckUtils]: 86: Hoare triple {2652#(<= ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2668#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:40,718 INFO L281 TraceCheckUtils]: 87: Hoare triple {2668#(<= ~counter~0 17)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2668#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:40,718 INFO L281 TraceCheckUtils]: 88: Hoare triple {2668#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {2668#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:40,718 INFO L281 TraceCheckUtils]: 89: Hoare triple {2668#(<= ~counter~0 17)} assume !!(0 != main_~r~0); {2668#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:40,719 INFO L281 TraceCheckUtils]: 90: Hoare triple {2668#(<= ~counter~0 17)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2668#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:40,719 INFO L281 TraceCheckUtils]: 91: Hoare triple {2668#(<= ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2684#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:40,719 INFO L281 TraceCheckUtils]: 92: Hoare triple {2684#(<= ~counter~0 18)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2684#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:40,720 INFO L281 TraceCheckUtils]: 93: Hoare triple {2684#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {2684#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:40,720 INFO L281 TraceCheckUtils]: 94: Hoare triple {2684#(<= ~counter~0 18)} assume !!(0 != main_~r~0); {2684#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:40,720 INFO L281 TraceCheckUtils]: 95: Hoare triple {2684#(<= ~counter~0 18)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2684#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:40,720 INFO L281 TraceCheckUtils]: 96: Hoare triple {2684#(<= ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2700#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:40,721 INFO L281 TraceCheckUtils]: 97: Hoare triple {2700#(<= ~counter~0 19)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2700#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:40,721 INFO L281 TraceCheckUtils]: 98: Hoare triple {2700#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {2700#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:40,721 INFO L281 TraceCheckUtils]: 99: Hoare triple {2700#(<= ~counter~0 19)} assume !!(0 != main_~r~0); {2700#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:40,722 INFO L281 TraceCheckUtils]: 100: Hoare triple {2700#(<= ~counter~0 19)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2700#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:40,722 INFO L281 TraceCheckUtils]: 101: Hoare triple {2700#(<= ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2716#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:40,722 INFO L281 TraceCheckUtils]: 102: Hoare triple {2716#(<= ~counter~0 20)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2716#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:40,722 INFO L281 TraceCheckUtils]: 103: Hoare triple {2716#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {2716#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:40,723 INFO L281 TraceCheckUtils]: 104: Hoare triple {2716#(<= ~counter~0 20)} assume !!(0 != main_~r~0); {2716#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:40,723 INFO L281 TraceCheckUtils]: 105: Hoare triple {2716#(<= ~counter~0 20)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2716#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:40,723 INFO L281 TraceCheckUtils]: 106: Hoare triple {2716#(<= ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2732#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:40,724 INFO L281 TraceCheckUtils]: 107: Hoare triple {2732#(<= ~counter~0 21)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2732#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:40,724 INFO L281 TraceCheckUtils]: 108: Hoare triple {2732#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {2732#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:40,724 INFO L281 TraceCheckUtils]: 109: Hoare triple {2732#(<= ~counter~0 21)} assume !!(0 != main_~r~0); {2732#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:40,724 INFO L281 TraceCheckUtils]: 110: Hoare triple {2732#(<= ~counter~0 21)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2732#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:40,725 INFO L281 TraceCheckUtils]: 111: Hoare triple {2732#(<= ~counter~0 21)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2748#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:40,725 INFO L281 TraceCheckUtils]: 112: Hoare triple {2748#(<= ~counter~0 22)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2748#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:40,725 INFO L281 TraceCheckUtils]: 113: Hoare triple {2748#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {2748#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:40,726 INFO L281 TraceCheckUtils]: 114: Hoare triple {2748#(<= ~counter~0 22)} assume !!(0 != main_~r~0); {2748#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:40,726 INFO L281 TraceCheckUtils]: 115: Hoare triple {2748#(<= ~counter~0 22)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2748#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:40,726 INFO L281 TraceCheckUtils]: 116: Hoare triple {2748#(<= ~counter~0 22)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2764#(<= |ULTIMATE.start_main_#t~post9| 22)} is VALID [2021-09-13 14:28:40,726 INFO L281 TraceCheckUtils]: 117: Hoare triple {2764#(<= |ULTIMATE.start_main_#t~post9| 22)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {2389#false} is VALID [2021-09-13 14:28:40,727 INFO L281 TraceCheckUtils]: 118: Hoare triple {2389#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2389#false} is VALID [2021-09-13 14:28:40,727 INFO L281 TraceCheckUtils]: 119: Hoare triple {2389#false} assume 0 == __VERIFIER_assert_~cond; {2389#false} is VALID [2021-09-13 14:28:40,727 INFO L281 TraceCheckUtils]: 120: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2021-09-13 14:28:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:40,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:42,046 INFO L281 TraceCheckUtils]: 120: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2021-09-13 14:28:42,047 INFO L281 TraceCheckUtils]: 119: Hoare triple {2389#false} assume 0 == __VERIFIER_assert_~cond; {2389#false} is VALID [2021-09-13 14:28:42,048 INFO L281 TraceCheckUtils]: 118: Hoare triple {2389#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2389#false} is VALID [2021-09-13 14:28:42,048 INFO L281 TraceCheckUtils]: 117: Hoare triple {2786#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {2389#false} is VALID [2021-09-13 14:28:42,049 INFO L281 TraceCheckUtils]: 116: Hoare triple {2790#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2786#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:28:42,049 INFO L281 TraceCheckUtils]: 115: Hoare triple {2790#(< ~counter~0 50)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2790#(< ~counter~0 50)} is VALID [2021-09-13 14:28:42,049 INFO L281 TraceCheckUtils]: 114: Hoare triple {2790#(< ~counter~0 50)} assume !!(0 != main_~r~0); {2790#(< ~counter~0 50)} is VALID [2021-09-13 14:28:42,050 INFO L281 TraceCheckUtils]: 113: Hoare triple {2790#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {2790#(< ~counter~0 50)} is VALID [2021-09-13 14:28:42,050 INFO L281 TraceCheckUtils]: 112: Hoare triple {2790#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2790#(< ~counter~0 50)} is VALID [2021-09-13 14:28:42,051 INFO L281 TraceCheckUtils]: 111: Hoare triple {2806#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2790#(< ~counter~0 50)} is VALID [2021-09-13 14:28:42,051 INFO L281 TraceCheckUtils]: 110: Hoare triple {2806#(< ~counter~0 49)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2806#(< ~counter~0 49)} is VALID [2021-09-13 14:28:42,052 INFO L281 TraceCheckUtils]: 109: Hoare triple {2806#(< ~counter~0 49)} assume !!(0 != main_~r~0); {2806#(< ~counter~0 49)} is VALID [2021-09-13 14:28:42,052 INFO L281 TraceCheckUtils]: 108: Hoare triple {2806#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {2806#(< ~counter~0 49)} is VALID [2021-09-13 14:28:42,052 INFO L281 TraceCheckUtils]: 107: Hoare triple {2806#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2806#(< ~counter~0 49)} is VALID [2021-09-13 14:28:42,053 INFO L281 TraceCheckUtils]: 106: Hoare triple {2822#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2806#(< ~counter~0 49)} is VALID [2021-09-13 14:28:42,053 INFO L281 TraceCheckUtils]: 105: Hoare triple {2822#(< ~counter~0 48)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2822#(< ~counter~0 48)} is VALID [2021-09-13 14:28:42,053 INFO L281 TraceCheckUtils]: 104: Hoare triple {2822#(< ~counter~0 48)} assume !!(0 != main_~r~0); {2822#(< ~counter~0 48)} is VALID [2021-09-13 14:28:42,054 INFO L281 TraceCheckUtils]: 103: Hoare triple {2822#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {2822#(< ~counter~0 48)} is VALID [2021-09-13 14:28:42,054 INFO L281 TraceCheckUtils]: 102: Hoare triple {2822#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2822#(< ~counter~0 48)} is VALID [2021-09-13 14:28:42,055 INFO L281 TraceCheckUtils]: 101: Hoare triple {2838#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2822#(< ~counter~0 48)} is VALID [2021-09-13 14:28:42,055 INFO L281 TraceCheckUtils]: 100: Hoare triple {2838#(< ~counter~0 47)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2838#(< ~counter~0 47)} is VALID [2021-09-13 14:28:42,055 INFO L281 TraceCheckUtils]: 99: Hoare triple {2838#(< ~counter~0 47)} assume !!(0 != main_~r~0); {2838#(< ~counter~0 47)} is VALID [2021-09-13 14:28:42,056 INFO L281 TraceCheckUtils]: 98: Hoare triple {2838#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {2838#(< ~counter~0 47)} is VALID [2021-09-13 14:28:42,056 INFO L281 TraceCheckUtils]: 97: Hoare triple {2838#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2838#(< ~counter~0 47)} is VALID [2021-09-13 14:28:42,057 INFO L281 TraceCheckUtils]: 96: Hoare triple {2854#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2838#(< ~counter~0 47)} is VALID [2021-09-13 14:28:42,057 INFO L281 TraceCheckUtils]: 95: Hoare triple {2854#(< ~counter~0 46)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2854#(< ~counter~0 46)} is VALID [2021-09-13 14:28:42,057 INFO L281 TraceCheckUtils]: 94: Hoare triple {2854#(< ~counter~0 46)} assume !!(0 != main_~r~0); {2854#(< ~counter~0 46)} is VALID [2021-09-13 14:28:42,058 INFO L281 TraceCheckUtils]: 93: Hoare triple {2854#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {2854#(< ~counter~0 46)} is VALID [2021-09-13 14:28:42,058 INFO L281 TraceCheckUtils]: 92: Hoare triple {2854#(< ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2854#(< ~counter~0 46)} is VALID [2021-09-13 14:28:42,058 INFO L281 TraceCheckUtils]: 91: Hoare triple {2870#(< ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2854#(< ~counter~0 46)} is VALID [2021-09-13 14:28:42,059 INFO L281 TraceCheckUtils]: 90: Hoare triple {2870#(< ~counter~0 45)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2870#(< ~counter~0 45)} is VALID [2021-09-13 14:28:42,059 INFO L281 TraceCheckUtils]: 89: Hoare triple {2870#(< ~counter~0 45)} assume !!(0 != main_~r~0); {2870#(< ~counter~0 45)} is VALID [2021-09-13 14:28:42,060 INFO L281 TraceCheckUtils]: 88: Hoare triple {2870#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {2870#(< ~counter~0 45)} is VALID [2021-09-13 14:28:42,060 INFO L281 TraceCheckUtils]: 87: Hoare triple {2870#(< ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2870#(< ~counter~0 45)} is VALID [2021-09-13 14:28:42,060 INFO L281 TraceCheckUtils]: 86: Hoare triple {2886#(< ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2870#(< ~counter~0 45)} is VALID [2021-09-13 14:28:42,061 INFO L281 TraceCheckUtils]: 85: Hoare triple {2886#(< ~counter~0 44)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2886#(< ~counter~0 44)} is VALID [2021-09-13 14:28:42,061 INFO L281 TraceCheckUtils]: 84: Hoare triple {2886#(< ~counter~0 44)} assume !!(0 != main_~r~0); {2886#(< ~counter~0 44)} is VALID [2021-09-13 14:28:42,061 INFO L281 TraceCheckUtils]: 83: Hoare triple {2886#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {2886#(< ~counter~0 44)} is VALID [2021-09-13 14:28:42,062 INFO L281 TraceCheckUtils]: 82: Hoare triple {2886#(< ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2886#(< ~counter~0 44)} is VALID [2021-09-13 14:28:42,062 INFO L281 TraceCheckUtils]: 81: Hoare triple {2902#(< ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2886#(< ~counter~0 44)} is VALID [2021-09-13 14:28:42,063 INFO L281 TraceCheckUtils]: 80: Hoare triple {2902#(< ~counter~0 43)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2902#(< ~counter~0 43)} is VALID [2021-09-13 14:28:42,063 INFO L281 TraceCheckUtils]: 79: Hoare triple {2902#(< ~counter~0 43)} assume !!(0 != main_~r~0); {2902#(< ~counter~0 43)} is VALID [2021-09-13 14:28:42,063 INFO L281 TraceCheckUtils]: 78: Hoare triple {2902#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {2902#(< ~counter~0 43)} is VALID [2021-09-13 14:28:42,064 INFO L281 TraceCheckUtils]: 77: Hoare triple {2902#(< ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2902#(< ~counter~0 43)} is VALID [2021-09-13 14:28:42,064 INFO L281 TraceCheckUtils]: 76: Hoare triple {2918#(< ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2902#(< ~counter~0 43)} is VALID [2021-09-13 14:28:42,065 INFO L281 TraceCheckUtils]: 75: Hoare triple {2918#(< ~counter~0 42)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2918#(< ~counter~0 42)} is VALID [2021-09-13 14:28:42,065 INFO L281 TraceCheckUtils]: 74: Hoare triple {2918#(< ~counter~0 42)} assume !!(0 != main_~r~0); {2918#(< ~counter~0 42)} is VALID [2021-09-13 14:28:42,065 INFO L281 TraceCheckUtils]: 73: Hoare triple {2918#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {2918#(< ~counter~0 42)} is VALID [2021-09-13 14:28:42,066 INFO L281 TraceCheckUtils]: 72: Hoare triple {2918#(< ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2918#(< ~counter~0 42)} is VALID [2021-09-13 14:28:42,066 INFO L281 TraceCheckUtils]: 71: Hoare triple {2934#(< ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2918#(< ~counter~0 42)} is VALID [2021-09-13 14:28:42,067 INFO L281 TraceCheckUtils]: 70: Hoare triple {2934#(< ~counter~0 41)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2934#(< ~counter~0 41)} is VALID [2021-09-13 14:28:42,067 INFO L281 TraceCheckUtils]: 69: Hoare triple {2934#(< ~counter~0 41)} assume !!(0 != main_~r~0); {2934#(< ~counter~0 41)} is VALID [2021-09-13 14:28:42,067 INFO L281 TraceCheckUtils]: 68: Hoare triple {2934#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {2934#(< ~counter~0 41)} is VALID [2021-09-13 14:28:42,067 INFO L281 TraceCheckUtils]: 67: Hoare triple {2934#(< ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2934#(< ~counter~0 41)} is VALID [2021-09-13 14:28:42,068 INFO L281 TraceCheckUtils]: 66: Hoare triple {2950#(< ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2934#(< ~counter~0 41)} is VALID [2021-09-13 14:28:42,068 INFO L281 TraceCheckUtils]: 65: Hoare triple {2950#(< ~counter~0 40)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2950#(< ~counter~0 40)} is VALID [2021-09-13 14:28:42,069 INFO L281 TraceCheckUtils]: 64: Hoare triple {2950#(< ~counter~0 40)} assume !!(0 != main_~r~0); {2950#(< ~counter~0 40)} is VALID [2021-09-13 14:28:42,069 INFO L281 TraceCheckUtils]: 63: Hoare triple {2950#(< ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {2950#(< ~counter~0 40)} is VALID [2021-09-13 14:28:42,069 INFO L281 TraceCheckUtils]: 62: Hoare triple {2950#(< ~counter~0 40)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2950#(< ~counter~0 40)} is VALID [2021-09-13 14:28:42,070 INFO L281 TraceCheckUtils]: 61: Hoare triple {2966#(< ~counter~0 39)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2950#(< ~counter~0 40)} is VALID [2021-09-13 14:28:42,070 INFO L281 TraceCheckUtils]: 60: Hoare triple {2966#(< ~counter~0 39)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2966#(< ~counter~0 39)} is VALID [2021-09-13 14:28:42,070 INFO L281 TraceCheckUtils]: 59: Hoare triple {2966#(< ~counter~0 39)} assume !!(0 != main_~r~0); {2966#(< ~counter~0 39)} is VALID [2021-09-13 14:28:42,071 INFO L281 TraceCheckUtils]: 58: Hoare triple {2966#(< ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {2966#(< ~counter~0 39)} is VALID [2021-09-13 14:28:42,071 INFO L281 TraceCheckUtils]: 57: Hoare triple {2966#(< ~counter~0 39)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2966#(< ~counter~0 39)} is VALID [2021-09-13 14:28:42,071 INFO L281 TraceCheckUtils]: 56: Hoare triple {2982#(< ~counter~0 38)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2966#(< ~counter~0 39)} is VALID [2021-09-13 14:28:42,072 INFO L281 TraceCheckUtils]: 55: Hoare triple {2982#(< ~counter~0 38)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2982#(< ~counter~0 38)} is VALID [2021-09-13 14:28:42,072 INFO L281 TraceCheckUtils]: 54: Hoare triple {2982#(< ~counter~0 38)} assume !!(0 != main_~r~0); {2982#(< ~counter~0 38)} is VALID [2021-09-13 14:28:42,072 INFO L281 TraceCheckUtils]: 53: Hoare triple {2982#(< ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {2982#(< ~counter~0 38)} is VALID [2021-09-13 14:28:42,073 INFO L281 TraceCheckUtils]: 52: Hoare triple {2982#(< ~counter~0 38)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2982#(< ~counter~0 38)} is VALID [2021-09-13 14:28:42,073 INFO L281 TraceCheckUtils]: 51: Hoare triple {2998#(< ~counter~0 37)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2982#(< ~counter~0 38)} is VALID [2021-09-13 14:28:42,074 INFO L281 TraceCheckUtils]: 50: Hoare triple {2998#(< ~counter~0 37)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {2998#(< ~counter~0 37)} is VALID [2021-09-13 14:28:42,074 INFO L281 TraceCheckUtils]: 49: Hoare triple {2998#(< ~counter~0 37)} assume !!(0 != main_~r~0); {2998#(< ~counter~0 37)} is VALID [2021-09-13 14:28:42,074 INFO L281 TraceCheckUtils]: 48: Hoare triple {2998#(< ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {2998#(< ~counter~0 37)} is VALID [2021-09-13 14:28:42,075 INFO L281 TraceCheckUtils]: 47: Hoare triple {2998#(< ~counter~0 37)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2998#(< ~counter~0 37)} is VALID [2021-09-13 14:28:42,075 INFO L281 TraceCheckUtils]: 46: Hoare triple {3014#(< ~counter~0 36)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2998#(< ~counter~0 37)} is VALID [2021-09-13 14:28:42,076 INFO L281 TraceCheckUtils]: 45: Hoare triple {3014#(< ~counter~0 36)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3014#(< ~counter~0 36)} is VALID [2021-09-13 14:28:42,076 INFO L281 TraceCheckUtils]: 44: Hoare triple {3014#(< ~counter~0 36)} assume !!(0 != main_~r~0); {3014#(< ~counter~0 36)} is VALID [2021-09-13 14:28:42,076 INFO L281 TraceCheckUtils]: 43: Hoare triple {3014#(< ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {3014#(< ~counter~0 36)} is VALID [2021-09-13 14:28:42,077 INFO L281 TraceCheckUtils]: 42: Hoare triple {3014#(< ~counter~0 36)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3014#(< ~counter~0 36)} is VALID [2021-09-13 14:28:42,077 INFO L281 TraceCheckUtils]: 41: Hoare triple {3030#(< ~counter~0 35)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3014#(< ~counter~0 36)} is VALID [2021-09-13 14:28:42,078 INFO L281 TraceCheckUtils]: 40: Hoare triple {3030#(< ~counter~0 35)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3030#(< ~counter~0 35)} is VALID [2021-09-13 14:28:42,078 INFO L281 TraceCheckUtils]: 39: Hoare triple {3030#(< ~counter~0 35)} assume !!(0 != main_~r~0); {3030#(< ~counter~0 35)} is VALID [2021-09-13 14:28:42,078 INFO L281 TraceCheckUtils]: 38: Hoare triple {3030#(< ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {3030#(< ~counter~0 35)} is VALID [2021-09-13 14:28:42,079 INFO L281 TraceCheckUtils]: 37: Hoare triple {3030#(< ~counter~0 35)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3030#(< ~counter~0 35)} is VALID [2021-09-13 14:28:42,079 INFO L281 TraceCheckUtils]: 36: Hoare triple {3046#(< ~counter~0 34)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3030#(< ~counter~0 35)} is VALID [2021-09-13 14:28:42,080 INFO L281 TraceCheckUtils]: 35: Hoare triple {3046#(< ~counter~0 34)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3046#(< ~counter~0 34)} is VALID [2021-09-13 14:28:42,080 INFO L281 TraceCheckUtils]: 34: Hoare triple {3046#(< ~counter~0 34)} assume !!(0 != main_~r~0); {3046#(< ~counter~0 34)} is VALID [2021-09-13 14:28:42,080 INFO L281 TraceCheckUtils]: 33: Hoare triple {3046#(< ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {3046#(< ~counter~0 34)} is VALID [2021-09-13 14:28:42,081 INFO L281 TraceCheckUtils]: 32: Hoare triple {3046#(< ~counter~0 34)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3046#(< ~counter~0 34)} is VALID [2021-09-13 14:28:42,081 INFO L281 TraceCheckUtils]: 31: Hoare triple {3062#(< ~counter~0 33)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3046#(< ~counter~0 34)} is VALID [2021-09-13 14:28:42,081 INFO L281 TraceCheckUtils]: 30: Hoare triple {3062#(< ~counter~0 33)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3062#(< ~counter~0 33)} is VALID [2021-09-13 14:28:42,082 INFO L281 TraceCheckUtils]: 29: Hoare triple {3062#(< ~counter~0 33)} assume !!(0 != main_~r~0); {3062#(< ~counter~0 33)} is VALID [2021-09-13 14:28:42,082 INFO L281 TraceCheckUtils]: 28: Hoare triple {3062#(< ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {3062#(< ~counter~0 33)} is VALID [2021-09-13 14:28:42,082 INFO L281 TraceCheckUtils]: 27: Hoare triple {3062#(< ~counter~0 33)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3062#(< ~counter~0 33)} is VALID [2021-09-13 14:28:42,083 INFO L281 TraceCheckUtils]: 26: Hoare triple {3078#(< ~counter~0 32)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3062#(< ~counter~0 33)} is VALID [2021-09-13 14:28:42,083 INFO L281 TraceCheckUtils]: 25: Hoare triple {3078#(< ~counter~0 32)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3078#(< ~counter~0 32)} is VALID [2021-09-13 14:28:42,084 INFO L281 TraceCheckUtils]: 24: Hoare triple {3078#(< ~counter~0 32)} assume !!(0 != main_~r~0); {3078#(< ~counter~0 32)} is VALID [2021-09-13 14:28:42,084 INFO L281 TraceCheckUtils]: 23: Hoare triple {3078#(< ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {3078#(< ~counter~0 32)} is VALID [2021-09-13 14:28:42,084 INFO L281 TraceCheckUtils]: 22: Hoare triple {3078#(< ~counter~0 32)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3078#(< ~counter~0 32)} is VALID [2021-09-13 14:28:42,085 INFO L281 TraceCheckUtils]: 21: Hoare triple {3094#(< ~counter~0 31)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3078#(< ~counter~0 32)} is VALID [2021-09-13 14:28:42,085 INFO L281 TraceCheckUtils]: 20: Hoare triple {3094#(< ~counter~0 31)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3094#(< ~counter~0 31)} is VALID [2021-09-13 14:28:42,086 INFO L281 TraceCheckUtils]: 19: Hoare triple {3094#(< ~counter~0 31)} assume !!(0 != main_~r~0); {3094#(< ~counter~0 31)} is VALID [2021-09-13 14:28:42,086 INFO L281 TraceCheckUtils]: 18: Hoare triple {3094#(< ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {3094#(< ~counter~0 31)} is VALID [2021-09-13 14:28:42,086 INFO L281 TraceCheckUtils]: 17: Hoare triple {3094#(< ~counter~0 31)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3094#(< ~counter~0 31)} is VALID [2021-09-13 14:28:42,087 INFO L281 TraceCheckUtils]: 16: Hoare triple {3110#(< ~counter~0 30)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3094#(< ~counter~0 31)} is VALID [2021-09-13 14:28:42,087 INFO L281 TraceCheckUtils]: 15: Hoare triple {3110#(< ~counter~0 30)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3110#(< ~counter~0 30)} is VALID [2021-09-13 14:28:42,088 INFO L281 TraceCheckUtils]: 14: Hoare triple {3110#(< ~counter~0 30)} assume !!(0 != main_~r~0); {3110#(< ~counter~0 30)} is VALID [2021-09-13 14:28:42,088 INFO L281 TraceCheckUtils]: 13: Hoare triple {3110#(< ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {3110#(< ~counter~0 30)} is VALID [2021-09-13 14:28:42,088 INFO L281 TraceCheckUtils]: 12: Hoare triple {3110#(< ~counter~0 30)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3110#(< ~counter~0 30)} is VALID [2021-09-13 14:28:42,089 INFO L281 TraceCheckUtils]: 11: Hoare triple {3126#(< ~counter~0 29)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3110#(< ~counter~0 30)} is VALID [2021-09-13 14:28:42,089 INFO L281 TraceCheckUtils]: 10: Hoare triple {3126#(< ~counter~0 29)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {3126#(< ~counter~0 29)} is VALID [2021-09-13 14:28:42,089 INFO L281 TraceCheckUtils]: 9: Hoare triple {3126#(< ~counter~0 29)} assume !!(0 != main_~r~0); {3126#(< ~counter~0 29)} is VALID [2021-09-13 14:28:42,090 INFO L281 TraceCheckUtils]: 8: Hoare triple {3126#(< ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {3126#(< ~counter~0 29)} is VALID [2021-09-13 14:28:42,090 INFO L281 TraceCheckUtils]: 7: Hoare triple {3126#(< ~counter~0 29)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3126#(< ~counter~0 29)} is VALID [2021-09-13 14:28:42,091 INFO L281 TraceCheckUtils]: 6: Hoare triple {3142#(< ~counter~0 28)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3126#(< ~counter~0 29)} is VALID [2021-09-13 14:28:42,091 INFO L281 TraceCheckUtils]: 5: Hoare triple {3142#(< ~counter~0 28)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {3142#(< ~counter~0 28)} is VALID [2021-09-13 14:28:42,091 INFO L281 TraceCheckUtils]: 4: Hoare triple {3142#(< ~counter~0 28)} assume !(0 == assume_abort_if_not_~cond); {3142#(< ~counter~0 28)} is VALID [2021-09-13 14:28:42,092 INFO L281 TraceCheckUtils]: 3: Hoare triple {3142#(< ~counter~0 28)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3142#(< ~counter~0 28)} is VALID [2021-09-13 14:28:42,092 INFO L281 TraceCheckUtils]: 2: Hoare triple {3142#(< ~counter~0 28)} assume !(0 == assume_abort_if_not_~cond); {3142#(< ~counter~0 28)} is VALID [2021-09-13 14:28:42,092 INFO L281 TraceCheckUtils]: 1: Hoare triple {3142#(< ~counter~0 28)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3142#(< ~counter~0 28)} is VALID [2021-09-13 14:28:42,093 INFO L281 TraceCheckUtils]: 0: Hoare triple {2388#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {3142#(< ~counter~0 28)} is VALID [2021-09-13 14:28:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:42,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:42,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928385777] [2021-09-13 14:28:42,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:42,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148338579] [2021-09-13 14:28:42,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148338579] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:42,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:42,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2021-09-13 14:28:42,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106977006] [2021-09-13 14:28:42,096 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 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 121 [2021-09-13 14:28:42,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:42,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:42,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:42,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-09-13 14:28:42,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:42,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-09-13 14:28:42,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-09-13 14:28:42,266 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:43,938 INFO L93 Difference]: Finished difference Result 246 states and 315 transitions. [2021-09-13 14:28:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-09-13 14:28:43,938 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 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 121 [2021-09-13 14:28:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 315 transitions. [2021-09-13 14:28:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 315 transitions. [2021-09-13 14:28:43,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 315 transitions. [2021-09-13 14:28:44,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:44,165 INFO L225 Difference]: With dead ends: 246 [2021-09-13 14:28:44,165 INFO L226 Difference]: Without dead ends: 242 [2021-09-13 14:28:44,167 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1542.27ms TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-09-13 14:28:44,167 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 212.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.43ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 215.56ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:44,168 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 366 Unknown, 0 Unchecked, 4.43ms Time], IncrementalHoareTripleChecker [53 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 215.56ms Time] [2021-09-13 14:28:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-09-13 14:28:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-09-13 14:28:44,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:44,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 242 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 241 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call 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:44,465 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 242 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 241 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call 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:44,466 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 242 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 241 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call 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:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:44,470 INFO L93 Difference]: Finished difference Result 242 states and 288 transitions. [2021-09-13 14:28:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 288 transitions. [2021-09-13 14:28:44,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:44,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:44,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 241 states have internal predecessors, (288), 0 states have call successors, (0), 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 242 states. [2021-09-13 14:28:44,471 INFO L87 Difference]: Start difference. First operand has 242 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 241 states have internal predecessors, (288), 0 states have call successors, (0), 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 242 states. [2021-09-13 14:28:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:44,476 INFO L93 Difference]: Finished difference Result 242 states and 288 transitions. [2021-09-13 14:28:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 288 transitions. [2021-09-13 14:28:44,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:44,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:44,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:44,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 241 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call 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:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 288 transitions. [2021-09-13 14:28:44,482 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 288 transitions. Word has length 121 [2021-09-13 14:28:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:44,482 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 288 transitions. [2021-09-13 14:28:44,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.78) internal successors, (239), 49 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 288 transitions. [2021-09-13 14:28:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-09-13 14:28:44,484 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:44,484 INFO L513 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:44,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:44,705 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,SelfDestructingSolverStorable7 [2021-09-13 14:28:44,705 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2072351253, now seen corresponding path program 5 times [2021-09-13 14:28:44,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:44,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907701466] [2021-09-13 14:28:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:44,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:44,715 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:44,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037480534] [2021-09-13 14:28:44,716 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-09-13 14:28:44,716 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:44,737 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:28:44,738 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:28:45,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-09-13 14:28:45,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:28:45,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 95 conjunts are in the unsatisfiable core [2021-09-13 14:28:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:45,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:47,914 INFO L281 TraceCheckUtils]: 0: Hoare triple {4408#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {4413#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:47,915 INFO L281 TraceCheckUtils]: 1: Hoare triple {4413#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4413#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:47,915 INFO L281 TraceCheckUtils]: 2: Hoare triple {4413#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {4413#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:47,915 INFO L281 TraceCheckUtils]: 3: Hoare triple {4413#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4413#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:47,916 INFO L281 TraceCheckUtils]: 4: Hoare triple {4413#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {4413#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:47,916 INFO L281 TraceCheckUtils]: 5: Hoare triple {4413#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {4413#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:47,917 INFO L281 TraceCheckUtils]: 6: Hoare triple {4413#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4432#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:47,917 INFO L281 TraceCheckUtils]: 7: Hoare triple {4432#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4432#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:47,917 INFO L281 TraceCheckUtils]: 8: Hoare triple {4432#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {4432#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:47,917 INFO L281 TraceCheckUtils]: 9: Hoare triple {4432#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {4432#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:47,918 INFO L281 TraceCheckUtils]: 10: Hoare triple {4432#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4432#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:47,918 INFO L281 TraceCheckUtils]: 11: Hoare triple {4432#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4448#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:47,918 INFO L281 TraceCheckUtils]: 12: Hoare triple {4448#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4448#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:47,919 INFO L281 TraceCheckUtils]: 13: Hoare triple {4448#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {4448#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:47,919 INFO L281 TraceCheckUtils]: 14: Hoare triple {4448#(<= ~counter~0 2)} assume !!(0 != main_~r~0); {4448#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:47,919 INFO L281 TraceCheckUtils]: 15: Hoare triple {4448#(<= ~counter~0 2)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4448#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:47,920 INFO L281 TraceCheckUtils]: 16: Hoare triple {4448#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:47,920 INFO L281 TraceCheckUtils]: 17: Hoare triple {4464#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:47,920 INFO L281 TraceCheckUtils]: 18: Hoare triple {4464#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:47,921 INFO L281 TraceCheckUtils]: 19: Hoare triple {4464#(<= ~counter~0 3)} assume !!(0 != main_~r~0); {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:47,921 INFO L281 TraceCheckUtils]: 20: Hoare triple {4464#(<= ~counter~0 3)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:47,921 INFO L281 TraceCheckUtils]: 21: Hoare triple {4464#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:47,922 INFO L281 TraceCheckUtils]: 22: Hoare triple {4480#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:47,922 INFO L281 TraceCheckUtils]: 23: Hoare triple {4480#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:47,922 INFO L281 TraceCheckUtils]: 24: Hoare triple {4480#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:47,923 INFO L281 TraceCheckUtils]: 25: Hoare triple {4480#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:47,923 INFO L281 TraceCheckUtils]: 26: Hoare triple {4480#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:47,923 INFO L281 TraceCheckUtils]: 27: Hoare triple {4496#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:47,924 INFO L281 TraceCheckUtils]: 28: Hoare triple {4496#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:47,924 INFO L281 TraceCheckUtils]: 29: Hoare triple {4496#(<= ~counter~0 5)} assume !!(0 != main_~r~0); {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:47,924 INFO L281 TraceCheckUtils]: 30: Hoare triple {4496#(<= ~counter~0 5)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:47,925 INFO L281 TraceCheckUtils]: 31: Hoare triple {4496#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:47,925 INFO L281 TraceCheckUtils]: 32: Hoare triple {4512#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:47,925 INFO L281 TraceCheckUtils]: 33: Hoare triple {4512#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:47,925 INFO L281 TraceCheckUtils]: 34: Hoare triple {4512#(<= ~counter~0 6)} assume !!(0 != main_~r~0); {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:47,926 INFO L281 TraceCheckUtils]: 35: Hoare triple {4512#(<= ~counter~0 6)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:47,926 INFO L281 TraceCheckUtils]: 36: Hoare triple {4512#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:47,926 INFO L281 TraceCheckUtils]: 37: Hoare triple {4528#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:47,927 INFO L281 TraceCheckUtils]: 38: Hoare triple {4528#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:47,927 INFO L281 TraceCheckUtils]: 39: Hoare triple {4528#(<= ~counter~0 7)} assume !!(0 != main_~r~0); {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:47,927 INFO L281 TraceCheckUtils]: 40: Hoare triple {4528#(<= ~counter~0 7)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:47,928 INFO L281 TraceCheckUtils]: 41: Hoare triple {4528#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:47,928 INFO L281 TraceCheckUtils]: 42: Hoare triple {4544#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:47,928 INFO L281 TraceCheckUtils]: 43: Hoare triple {4544#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:47,929 INFO L281 TraceCheckUtils]: 44: Hoare triple {4544#(<= ~counter~0 8)} assume !!(0 != main_~r~0); {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:47,929 INFO L281 TraceCheckUtils]: 45: Hoare triple {4544#(<= ~counter~0 8)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:47,929 INFO L281 TraceCheckUtils]: 46: Hoare triple {4544#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:47,930 INFO L281 TraceCheckUtils]: 47: Hoare triple {4560#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:47,930 INFO L281 TraceCheckUtils]: 48: Hoare triple {4560#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:47,930 INFO L281 TraceCheckUtils]: 49: Hoare triple {4560#(<= ~counter~0 9)} assume !!(0 != main_~r~0); {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:47,930 INFO L281 TraceCheckUtils]: 50: Hoare triple {4560#(<= ~counter~0 9)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:47,931 INFO L281 TraceCheckUtils]: 51: Hoare triple {4560#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:47,931 INFO L281 TraceCheckUtils]: 52: Hoare triple {4576#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:47,931 INFO L281 TraceCheckUtils]: 53: Hoare triple {4576#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:47,932 INFO L281 TraceCheckUtils]: 54: Hoare triple {4576#(<= ~counter~0 10)} assume !!(0 != main_~r~0); {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:47,932 INFO L281 TraceCheckUtils]: 55: Hoare triple {4576#(<= ~counter~0 10)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:47,932 INFO L281 TraceCheckUtils]: 56: Hoare triple {4576#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:47,933 INFO L281 TraceCheckUtils]: 57: Hoare triple {4592#(<= ~counter~0 11)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:47,933 INFO L281 TraceCheckUtils]: 58: Hoare triple {4592#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:47,933 INFO L281 TraceCheckUtils]: 59: Hoare triple {4592#(<= ~counter~0 11)} assume !!(0 != main_~r~0); {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:47,933 INFO L281 TraceCheckUtils]: 60: Hoare triple {4592#(<= ~counter~0 11)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:47,934 INFO L281 TraceCheckUtils]: 61: Hoare triple {4592#(<= ~counter~0 11)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:47,934 INFO L281 TraceCheckUtils]: 62: Hoare triple {4608#(<= ~counter~0 12)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:47,934 INFO L281 TraceCheckUtils]: 63: Hoare triple {4608#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:47,935 INFO L281 TraceCheckUtils]: 64: Hoare triple {4608#(<= ~counter~0 12)} assume !!(0 != main_~r~0); {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:47,935 INFO L281 TraceCheckUtils]: 65: Hoare triple {4608#(<= ~counter~0 12)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:47,935 INFO L281 TraceCheckUtils]: 66: Hoare triple {4608#(<= ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:47,936 INFO L281 TraceCheckUtils]: 67: Hoare triple {4624#(<= ~counter~0 13)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:47,936 INFO L281 TraceCheckUtils]: 68: Hoare triple {4624#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:47,936 INFO L281 TraceCheckUtils]: 69: Hoare triple {4624#(<= ~counter~0 13)} assume !!(0 != main_~r~0); {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:47,937 INFO L281 TraceCheckUtils]: 70: Hoare triple {4624#(<= ~counter~0 13)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:47,937 INFO L281 TraceCheckUtils]: 71: Hoare triple {4624#(<= ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:47,937 INFO L281 TraceCheckUtils]: 72: Hoare triple {4640#(<= ~counter~0 14)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:47,938 INFO L281 TraceCheckUtils]: 73: Hoare triple {4640#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:47,938 INFO L281 TraceCheckUtils]: 74: Hoare triple {4640#(<= ~counter~0 14)} assume !!(0 != main_~r~0); {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:47,938 INFO L281 TraceCheckUtils]: 75: Hoare triple {4640#(<= ~counter~0 14)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:47,939 INFO L281 TraceCheckUtils]: 76: Hoare triple {4640#(<= ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:47,939 INFO L281 TraceCheckUtils]: 77: Hoare triple {4656#(<= ~counter~0 15)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:47,939 INFO L281 TraceCheckUtils]: 78: Hoare triple {4656#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:47,939 INFO L281 TraceCheckUtils]: 79: Hoare triple {4656#(<= ~counter~0 15)} assume !!(0 != main_~r~0); {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:47,940 INFO L281 TraceCheckUtils]: 80: Hoare triple {4656#(<= ~counter~0 15)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:47,940 INFO L281 TraceCheckUtils]: 81: Hoare triple {4656#(<= ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:47,940 INFO L281 TraceCheckUtils]: 82: Hoare triple {4672#(<= ~counter~0 16)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:47,941 INFO L281 TraceCheckUtils]: 83: Hoare triple {4672#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:47,941 INFO L281 TraceCheckUtils]: 84: Hoare triple {4672#(<= ~counter~0 16)} assume !!(0 != main_~r~0); {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:47,941 INFO L281 TraceCheckUtils]: 85: Hoare triple {4672#(<= ~counter~0 16)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:47,942 INFO L281 TraceCheckUtils]: 86: Hoare triple {4672#(<= ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:47,942 INFO L281 TraceCheckUtils]: 87: Hoare triple {4688#(<= ~counter~0 17)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:47,942 INFO L281 TraceCheckUtils]: 88: Hoare triple {4688#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:47,943 INFO L281 TraceCheckUtils]: 89: Hoare triple {4688#(<= ~counter~0 17)} assume !!(0 != main_~r~0); {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:47,943 INFO L281 TraceCheckUtils]: 90: Hoare triple {4688#(<= ~counter~0 17)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:47,943 INFO L281 TraceCheckUtils]: 91: Hoare triple {4688#(<= ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:47,944 INFO L281 TraceCheckUtils]: 92: Hoare triple {4704#(<= ~counter~0 18)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:47,944 INFO L281 TraceCheckUtils]: 93: Hoare triple {4704#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:47,944 INFO L281 TraceCheckUtils]: 94: Hoare triple {4704#(<= ~counter~0 18)} assume !!(0 != main_~r~0); {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:47,944 INFO L281 TraceCheckUtils]: 95: Hoare triple {4704#(<= ~counter~0 18)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:47,945 INFO L281 TraceCheckUtils]: 96: Hoare triple {4704#(<= ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:47,945 INFO L281 TraceCheckUtils]: 97: Hoare triple {4720#(<= ~counter~0 19)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:47,945 INFO L281 TraceCheckUtils]: 98: Hoare triple {4720#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:47,946 INFO L281 TraceCheckUtils]: 99: Hoare triple {4720#(<= ~counter~0 19)} assume !!(0 != main_~r~0); {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:47,946 INFO L281 TraceCheckUtils]: 100: Hoare triple {4720#(<= ~counter~0 19)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:47,946 INFO L281 TraceCheckUtils]: 101: Hoare triple {4720#(<= ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:47,947 INFO L281 TraceCheckUtils]: 102: Hoare triple {4736#(<= ~counter~0 20)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:47,947 INFO L281 TraceCheckUtils]: 103: Hoare triple {4736#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:47,947 INFO L281 TraceCheckUtils]: 104: Hoare triple {4736#(<= ~counter~0 20)} assume !!(0 != main_~r~0); {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:47,948 INFO L281 TraceCheckUtils]: 105: Hoare triple {4736#(<= ~counter~0 20)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:47,948 INFO L281 TraceCheckUtils]: 106: Hoare triple {4736#(<= ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:47,948 INFO L281 TraceCheckUtils]: 107: Hoare triple {4752#(<= ~counter~0 21)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:47,949 INFO L281 TraceCheckUtils]: 108: Hoare triple {4752#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:47,949 INFO L281 TraceCheckUtils]: 109: Hoare triple {4752#(<= ~counter~0 21)} assume !!(0 != main_~r~0); {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:47,949 INFO L281 TraceCheckUtils]: 110: Hoare triple {4752#(<= ~counter~0 21)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:47,950 INFO L281 TraceCheckUtils]: 111: Hoare triple {4752#(<= ~counter~0 21)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:47,950 INFO L281 TraceCheckUtils]: 112: Hoare triple {4768#(<= ~counter~0 22)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:47,950 INFO L281 TraceCheckUtils]: 113: Hoare triple {4768#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:47,950 INFO L281 TraceCheckUtils]: 114: Hoare triple {4768#(<= ~counter~0 22)} assume !!(0 != main_~r~0); {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:47,951 INFO L281 TraceCheckUtils]: 115: Hoare triple {4768#(<= ~counter~0 22)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:47,951 INFO L281 TraceCheckUtils]: 116: Hoare triple {4768#(<= ~counter~0 22)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:47,952 INFO L281 TraceCheckUtils]: 117: Hoare triple {4784#(<= ~counter~0 23)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:47,952 INFO L281 TraceCheckUtils]: 118: Hoare triple {4784#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:47,952 INFO L281 TraceCheckUtils]: 119: Hoare triple {4784#(<= ~counter~0 23)} assume !!(0 != main_~r~0); {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:47,952 INFO L281 TraceCheckUtils]: 120: Hoare triple {4784#(<= ~counter~0 23)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:47,953 INFO L281 TraceCheckUtils]: 121: Hoare triple {4784#(<= ~counter~0 23)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:47,953 INFO L281 TraceCheckUtils]: 122: Hoare triple {4800#(<= ~counter~0 24)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:47,953 INFO L281 TraceCheckUtils]: 123: Hoare triple {4800#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:47,954 INFO L281 TraceCheckUtils]: 124: Hoare triple {4800#(<= ~counter~0 24)} assume !!(0 != main_~r~0); {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:47,954 INFO L281 TraceCheckUtils]: 125: Hoare triple {4800#(<= ~counter~0 24)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:47,954 INFO L281 TraceCheckUtils]: 126: Hoare triple {4800#(<= ~counter~0 24)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:47,955 INFO L281 TraceCheckUtils]: 127: Hoare triple {4816#(<= ~counter~0 25)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:47,955 INFO L281 TraceCheckUtils]: 128: Hoare triple {4816#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:47,955 INFO L281 TraceCheckUtils]: 129: Hoare triple {4816#(<= ~counter~0 25)} assume !!(0 != main_~r~0); {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:47,956 INFO L281 TraceCheckUtils]: 130: Hoare triple {4816#(<= ~counter~0 25)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:47,956 INFO L281 TraceCheckUtils]: 131: Hoare triple {4816#(<= ~counter~0 25)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:47,956 INFO L281 TraceCheckUtils]: 132: Hoare triple {4832#(<= ~counter~0 26)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:47,957 INFO L281 TraceCheckUtils]: 133: Hoare triple {4832#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:47,957 INFO L281 TraceCheckUtils]: 134: Hoare triple {4832#(<= ~counter~0 26)} assume !!(0 != main_~r~0); {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:47,957 INFO L281 TraceCheckUtils]: 135: Hoare triple {4832#(<= ~counter~0 26)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:47,958 INFO L281 TraceCheckUtils]: 136: Hoare triple {4832#(<= ~counter~0 26)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:47,958 INFO L281 TraceCheckUtils]: 137: Hoare triple {4848#(<= ~counter~0 27)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:47,958 INFO L281 TraceCheckUtils]: 138: Hoare triple {4848#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:47,958 INFO L281 TraceCheckUtils]: 139: Hoare triple {4848#(<= ~counter~0 27)} assume !!(0 != main_~r~0); {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:47,959 INFO L281 TraceCheckUtils]: 140: Hoare triple {4848#(<= ~counter~0 27)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:47,959 INFO L281 TraceCheckUtils]: 141: Hoare triple {4848#(<= ~counter~0 27)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:47,959 INFO L281 TraceCheckUtils]: 142: Hoare triple {4864#(<= ~counter~0 28)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:47,960 INFO L281 TraceCheckUtils]: 143: Hoare triple {4864#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:47,960 INFO L281 TraceCheckUtils]: 144: Hoare triple {4864#(<= ~counter~0 28)} assume !!(0 != main_~r~0); {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:47,960 INFO L281 TraceCheckUtils]: 145: Hoare triple {4864#(<= ~counter~0 28)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:47,961 INFO L281 TraceCheckUtils]: 146: Hoare triple {4864#(<= ~counter~0 28)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:47,961 INFO L281 TraceCheckUtils]: 147: Hoare triple {4880#(<= ~counter~0 29)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:47,961 INFO L281 TraceCheckUtils]: 148: Hoare triple {4880#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:47,962 INFO L281 TraceCheckUtils]: 149: Hoare triple {4880#(<= ~counter~0 29)} assume !!(0 != main_~r~0); {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:47,962 INFO L281 TraceCheckUtils]: 150: Hoare triple {4880#(<= ~counter~0 29)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:47,962 INFO L281 TraceCheckUtils]: 151: Hoare triple {4880#(<= ~counter~0 29)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:47,963 INFO L281 TraceCheckUtils]: 152: Hoare triple {4896#(<= ~counter~0 30)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:47,963 INFO L281 TraceCheckUtils]: 153: Hoare triple {4896#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:47,963 INFO L281 TraceCheckUtils]: 154: Hoare triple {4896#(<= ~counter~0 30)} assume !!(0 != main_~r~0); {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:47,963 INFO L281 TraceCheckUtils]: 155: Hoare triple {4896#(<= ~counter~0 30)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:47,964 INFO L281 TraceCheckUtils]: 156: Hoare triple {4896#(<= ~counter~0 30)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:47,964 INFO L281 TraceCheckUtils]: 157: Hoare triple {4912#(<= ~counter~0 31)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:47,964 INFO L281 TraceCheckUtils]: 158: Hoare triple {4912#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:47,965 INFO L281 TraceCheckUtils]: 159: Hoare triple {4912#(<= ~counter~0 31)} assume !!(0 != main_~r~0); {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:47,965 INFO L281 TraceCheckUtils]: 160: Hoare triple {4912#(<= ~counter~0 31)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:47,965 INFO L281 TraceCheckUtils]: 161: Hoare triple {4912#(<= ~counter~0 31)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:47,966 INFO L281 TraceCheckUtils]: 162: Hoare triple {4928#(<= ~counter~0 32)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:47,966 INFO L281 TraceCheckUtils]: 163: Hoare triple {4928#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:47,966 INFO L281 TraceCheckUtils]: 164: Hoare triple {4928#(<= ~counter~0 32)} assume !!(0 != main_~r~0); {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:47,967 INFO L281 TraceCheckUtils]: 165: Hoare triple {4928#(<= ~counter~0 32)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:47,967 INFO L281 TraceCheckUtils]: 166: Hoare triple {4928#(<= ~counter~0 32)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:47,967 INFO L281 TraceCheckUtils]: 167: Hoare triple {4944#(<= ~counter~0 33)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:47,968 INFO L281 TraceCheckUtils]: 168: Hoare triple {4944#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:47,968 INFO L281 TraceCheckUtils]: 169: Hoare triple {4944#(<= ~counter~0 33)} assume !!(0 != main_~r~0); {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:47,968 INFO L281 TraceCheckUtils]: 170: Hoare triple {4944#(<= ~counter~0 33)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:47,969 INFO L281 TraceCheckUtils]: 171: Hoare triple {4944#(<= ~counter~0 33)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:47,969 INFO L281 TraceCheckUtils]: 172: Hoare triple {4960#(<= ~counter~0 34)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:47,969 INFO L281 TraceCheckUtils]: 173: Hoare triple {4960#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:47,969 INFO L281 TraceCheckUtils]: 174: Hoare triple {4960#(<= ~counter~0 34)} assume !!(0 != main_~r~0); {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:47,970 INFO L281 TraceCheckUtils]: 175: Hoare triple {4960#(<= ~counter~0 34)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:47,970 INFO L281 TraceCheckUtils]: 176: Hoare triple {4960#(<= ~counter~0 34)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:47,970 INFO L281 TraceCheckUtils]: 177: Hoare triple {4976#(<= ~counter~0 35)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:47,971 INFO L281 TraceCheckUtils]: 178: Hoare triple {4976#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:47,971 INFO L281 TraceCheckUtils]: 179: Hoare triple {4976#(<= ~counter~0 35)} assume !!(0 != main_~r~0); {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:47,971 INFO L281 TraceCheckUtils]: 180: Hoare triple {4976#(<= ~counter~0 35)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:47,972 INFO L281 TraceCheckUtils]: 181: Hoare triple {4976#(<= ~counter~0 35)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:47,972 INFO L281 TraceCheckUtils]: 182: Hoare triple {4992#(<= ~counter~0 36)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:47,972 INFO L281 TraceCheckUtils]: 183: Hoare triple {4992#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:47,973 INFO L281 TraceCheckUtils]: 184: Hoare triple {4992#(<= ~counter~0 36)} assume !!(0 != main_~r~0); {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:47,973 INFO L281 TraceCheckUtils]: 185: Hoare triple {4992#(<= ~counter~0 36)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:47,973 INFO L281 TraceCheckUtils]: 186: Hoare triple {4992#(<= ~counter~0 36)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:47,974 INFO L281 TraceCheckUtils]: 187: Hoare triple {5008#(<= ~counter~0 37)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:47,974 INFO L281 TraceCheckUtils]: 188: Hoare triple {5008#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:47,974 INFO L281 TraceCheckUtils]: 189: Hoare triple {5008#(<= ~counter~0 37)} assume !!(0 != main_~r~0); {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:47,975 INFO L281 TraceCheckUtils]: 190: Hoare triple {5008#(<= ~counter~0 37)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:47,975 INFO L281 TraceCheckUtils]: 191: Hoare triple {5008#(<= ~counter~0 37)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:47,975 INFO L281 TraceCheckUtils]: 192: Hoare triple {5024#(<= ~counter~0 38)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:47,976 INFO L281 TraceCheckUtils]: 193: Hoare triple {5024#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:47,976 INFO L281 TraceCheckUtils]: 194: Hoare triple {5024#(<= ~counter~0 38)} assume !!(0 != main_~r~0); {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:47,976 INFO L281 TraceCheckUtils]: 195: Hoare triple {5024#(<= ~counter~0 38)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:47,977 INFO L281 TraceCheckUtils]: 196: Hoare triple {5024#(<= ~counter~0 38)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:47,977 INFO L281 TraceCheckUtils]: 197: Hoare triple {5040#(<= ~counter~0 39)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:47,977 INFO L281 TraceCheckUtils]: 198: Hoare triple {5040#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:47,978 INFO L281 TraceCheckUtils]: 199: Hoare triple {5040#(<= ~counter~0 39)} assume !!(0 != main_~r~0); {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:47,978 INFO L281 TraceCheckUtils]: 200: Hoare triple {5040#(<= ~counter~0 39)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:47,978 INFO L281 TraceCheckUtils]: 201: Hoare triple {5040#(<= ~counter~0 39)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:47,979 INFO L281 TraceCheckUtils]: 202: Hoare triple {5056#(<= ~counter~0 40)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:47,979 INFO L281 TraceCheckUtils]: 203: Hoare triple {5056#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:47,979 INFO L281 TraceCheckUtils]: 204: Hoare triple {5056#(<= ~counter~0 40)} assume !!(0 != main_~r~0); {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:47,980 INFO L281 TraceCheckUtils]: 205: Hoare triple {5056#(<= ~counter~0 40)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:47,980 INFO L281 TraceCheckUtils]: 206: Hoare triple {5056#(<= ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:47,980 INFO L281 TraceCheckUtils]: 207: Hoare triple {5072#(<= ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:47,981 INFO L281 TraceCheckUtils]: 208: Hoare triple {5072#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:47,981 INFO L281 TraceCheckUtils]: 209: Hoare triple {5072#(<= ~counter~0 41)} assume !!(0 != main_~r~0); {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:47,981 INFO L281 TraceCheckUtils]: 210: Hoare triple {5072#(<= ~counter~0 41)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:47,982 INFO L281 TraceCheckUtils]: 211: Hoare triple {5072#(<= ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:47,982 INFO L281 TraceCheckUtils]: 212: Hoare triple {5088#(<= ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:47,982 INFO L281 TraceCheckUtils]: 213: Hoare triple {5088#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:47,983 INFO L281 TraceCheckUtils]: 214: Hoare triple {5088#(<= ~counter~0 42)} assume !!(0 != main_~r~0); {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:47,983 INFO L281 TraceCheckUtils]: 215: Hoare triple {5088#(<= ~counter~0 42)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:47,983 INFO L281 TraceCheckUtils]: 216: Hoare triple {5088#(<= ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:47,984 INFO L281 TraceCheckUtils]: 217: Hoare triple {5104#(<= ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:47,984 INFO L281 TraceCheckUtils]: 218: Hoare triple {5104#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:47,984 INFO L281 TraceCheckUtils]: 219: Hoare triple {5104#(<= ~counter~0 43)} assume !!(0 != main_~r~0); {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:47,984 INFO L281 TraceCheckUtils]: 220: Hoare triple {5104#(<= ~counter~0 43)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:47,985 INFO L281 TraceCheckUtils]: 221: Hoare triple {5104#(<= ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:47,985 INFO L281 TraceCheckUtils]: 222: Hoare triple {5120#(<= ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:47,985 INFO L281 TraceCheckUtils]: 223: Hoare triple {5120#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:47,986 INFO L281 TraceCheckUtils]: 224: Hoare triple {5120#(<= ~counter~0 44)} assume !!(0 != main_~r~0); {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:47,986 INFO L281 TraceCheckUtils]: 225: Hoare triple {5120#(<= ~counter~0 44)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:47,987 INFO L281 TraceCheckUtils]: 226: Hoare triple {5120#(<= ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:47,987 INFO L281 TraceCheckUtils]: 227: Hoare triple {5136#(<= ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:47,987 INFO L281 TraceCheckUtils]: 228: Hoare triple {5136#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:47,987 INFO L281 TraceCheckUtils]: 229: Hoare triple {5136#(<= ~counter~0 45)} assume !!(0 != main_~r~0); {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:47,988 INFO L281 TraceCheckUtils]: 230: Hoare triple {5136#(<= ~counter~0 45)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:47,988 INFO L281 TraceCheckUtils]: 231: Hoare triple {5136#(<= ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:47,989 INFO L281 TraceCheckUtils]: 232: Hoare triple {5152#(<= ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:47,989 INFO L281 TraceCheckUtils]: 233: Hoare triple {5152#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:47,989 INFO L281 TraceCheckUtils]: 234: Hoare triple {5152#(<= ~counter~0 46)} assume !!(0 != main_~r~0); {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:47,990 INFO L281 TraceCheckUtils]: 235: Hoare triple {5152#(<= ~counter~0 46)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:47,990 INFO L281 TraceCheckUtils]: 236: Hoare triple {5152#(<= ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5168#(<= |ULTIMATE.start_main_#t~post9| 46)} is VALID [2021-09-13 14:28:47,990 INFO L281 TraceCheckUtils]: 237: Hoare triple {5168#(<= |ULTIMATE.start_main_#t~post9| 46)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {4409#false} is VALID [2021-09-13 14:28:47,991 INFO L281 TraceCheckUtils]: 238: Hoare triple {4409#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4409#false} is VALID [2021-09-13 14:28:47,991 INFO L281 TraceCheckUtils]: 239: Hoare triple {4409#false} assume 0 == __VERIFIER_assert_~cond; {4409#false} is VALID [2021-09-13 14:28:47,991 INFO L281 TraceCheckUtils]: 240: Hoare triple {4409#false} assume !false; {4409#false} is VALID [2021-09-13 14:28:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:47,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:50,103 INFO L281 TraceCheckUtils]: 240: Hoare triple {4409#false} assume !false; {4409#false} is VALID [2021-09-13 14:28:50,103 INFO L281 TraceCheckUtils]: 239: Hoare triple {4409#false} assume 0 == __VERIFIER_assert_~cond; {4409#false} is VALID [2021-09-13 14:28:50,104 INFO L281 TraceCheckUtils]: 238: Hoare triple {4409#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4409#false} is VALID [2021-09-13 14:28:50,104 INFO L281 TraceCheckUtils]: 237: Hoare triple {5190#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {4409#false} is VALID [2021-09-13 14:28:50,104 INFO L281 TraceCheckUtils]: 236: Hoare triple {5194#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5190#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:28:50,105 INFO L281 TraceCheckUtils]: 235: Hoare triple {5194#(< ~counter~0 50)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5194#(< ~counter~0 50)} is VALID [2021-09-13 14:28:50,105 INFO L281 TraceCheckUtils]: 234: Hoare triple {5194#(< ~counter~0 50)} assume !!(0 != main_~r~0); {5194#(< ~counter~0 50)} is VALID [2021-09-13 14:28:50,105 INFO L281 TraceCheckUtils]: 233: Hoare triple {5194#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {5194#(< ~counter~0 50)} is VALID [2021-09-13 14:28:50,106 INFO L281 TraceCheckUtils]: 232: Hoare triple {5194#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5194#(< ~counter~0 50)} is VALID [2021-09-13 14:28:50,106 INFO L281 TraceCheckUtils]: 231: Hoare triple {5210#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5194#(< ~counter~0 50)} is VALID [2021-09-13 14:28:50,106 INFO L281 TraceCheckUtils]: 230: Hoare triple {5210#(< ~counter~0 49)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5210#(< ~counter~0 49)} is VALID [2021-09-13 14:28:50,107 INFO L281 TraceCheckUtils]: 229: Hoare triple {5210#(< ~counter~0 49)} assume !!(0 != main_~r~0); {5210#(< ~counter~0 49)} is VALID [2021-09-13 14:28:50,107 INFO L281 TraceCheckUtils]: 228: Hoare triple {5210#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {5210#(< ~counter~0 49)} is VALID [2021-09-13 14:28:50,107 INFO L281 TraceCheckUtils]: 227: Hoare triple {5210#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5210#(< ~counter~0 49)} is VALID [2021-09-13 14:28:50,108 INFO L281 TraceCheckUtils]: 226: Hoare triple {5226#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5210#(< ~counter~0 49)} is VALID [2021-09-13 14:28:50,108 INFO L281 TraceCheckUtils]: 225: Hoare triple {5226#(< ~counter~0 48)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5226#(< ~counter~0 48)} is VALID [2021-09-13 14:28:50,108 INFO L281 TraceCheckUtils]: 224: Hoare triple {5226#(< ~counter~0 48)} assume !!(0 != main_~r~0); {5226#(< ~counter~0 48)} is VALID [2021-09-13 14:28:50,109 INFO L281 TraceCheckUtils]: 223: Hoare triple {5226#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {5226#(< ~counter~0 48)} is VALID [2021-09-13 14:28:50,109 INFO L281 TraceCheckUtils]: 222: Hoare triple {5226#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5226#(< ~counter~0 48)} is VALID [2021-09-13 14:28:50,110 INFO L281 TraceCheckUtils]: 221: Hoare triple {5152#(<= ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5226#(< ~counter~0 48)} is VALID [2021-09-13 14:28:50,110 INFO L281 TraceCheckUtils]: 220: Hoare triple {5152#(<= ~counter~0 46)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:50,110 INFO L281 TraceCheckUtils]: 219: Hoare triple {5152#(<= ~counter~0 46)} assume !!(0 != main_~r~0); {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:50,110 INFO L281 TraceCheckUtils]: 218: Hoare triple {5152#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:50,111 INFO L281 TraceCheckUtils]: 217: Hoare triple {5152#(<= ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:50,111 INFO L281 TraceCheckUtils]: 216: Hoare triple {5136#(<= ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5152#(<= ~counter~0 46)} is VALID [2021-09-13 14:28:50,112 INFO L281 TraceCheckUtils]: 215: Hoare triple {5136#(<= ~counter~0 45)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:50,112 INFO L281 TraceCheckUtils]: 214: Hoare triple {5136#(<= ~counter~0 45)} assume !!(0 != main_~r~0); {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:50,112 INFO L281 TraceCheckUtils]: 213: Hoare triple {5136#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:50,112 INFO L281 TraceCheckUtils]: 212: Hoare triple {5136#(<= ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:50,113 INFO L281 TraceCheckUtils]: 211: Hoare triple {5120#(<= ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5136#(<= ~counter~0 45)} is VALID [2021-09-13 14:28:50,113 INFO L281 TraceCheckUtils]: 210: Hoare triple {5120#(<= ~counter~0 44)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:50,113 INFO L281 TraceCheckUtils]: 209: Hoare triple {5120#(<= ~counter~0 44)} assume !!(0 != main_~r~0); {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:50,114 INFO L281 TraceCheckUtils]: 208: Hoare triple {5120#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:50,114 INFO L281 TraceCheckUtils]: 207: Hoare triple {5120#(<= ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:50,115 INFO L281 TraceCheckUtils]: 206: Hoare triple {5104#(<= ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5120#(<= ~counter~0 44)} is VALID [2021-09-13 14:28:50,115 INFO L281 TraceCheckUtils]: 205: Hoare triple {5104#(<= ~counter~0 43)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:50,115 INFO L281 TraceCheckUtils]: 204: Hoare triple {5104#(<= ~counter~0 43)} assume !!(0 != main_~r~0); {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:50,115 INFO L281 TraceCheckUtils]: 203: Hoare triple {5104#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:50,116 INFO L281 TraceCheckUtils]: 202: Hoare triple {5104#(<= ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:50,116 INFO L281 TraceCheckUtils]: 201: Hoare triple {5088#(<= ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5104#(<= ~counter~0 43)} is VALID [2021-09-13 14:28:50,117 INFO L281 TraceCheckUtils]: 200: Hoare triple {5088#(<= ~counter~0 42)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:50,117 INFO L281 TraceCheckUtils]: 199: Hoare triple {5088#(<= ~counter~0 42)} assume !!(0 != main_~r~0); {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:50,117 INFO L281 TraceCheckUtils]: 198: Hoare triple {5088#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:50,117 INFO L281 TraceCheckUtils]: 197: Hoare triple {5088#(<= ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:50,118 INFO L281 TraceCheckUtils]: 196: Hoare triple {5072#(<= ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5088#(<= ~counter~0 42)} is VALID [2021-09-13 14:28:50,118 INFO L281 TraceCheckUtils]: 195: Hoare triple {5072#(<= ~counter~0 41)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:50,119 INFO L281 TraceCheckUtils]: 194: Hoare triple {5072#(<= ~counter~0 41)} assume !!(0 != main_~r~0); {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:50,119 INFO L281 TraceCheckUtils]: 193: Hoare triple {5072#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:50,119 INFO L281 TraceCheckUtils]: 192: Hoare triple {5072#(<= ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:50,120 INFO L281 TraceCheckUtils]: 191: Hoare triple {5056#(<= ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5072#(<= ~counter~0 41)} is VALID [2021-09-13 14:28:50,120 INFO L281 TraceCheckUtils]: 190: Hoare triple {5056#(<= ~counter~0 40)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:50,120 INFO L281 TraceCheckUtils]: 189: Hoare triple {5056#(<= ~counter~0 40)} assume !!(0 != main_~r~0); {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:50,121 INFO L281 TraceCheckUtils]: 188: Hoare triple {5056#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:50,121 INFO L281 TraceCheckUtils]: 187: Hoare triple {5056#(<= ~counter~0 40)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:50,121 INFO L281 TraceCheckUtils]: 186: Hoare triple {5040#(<= ~counter~0 39)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5056#(<= ~counter~0 40)} is VALID [2021-09-13 14:28:50,122 INFO L281 TraceCheckUtils]: 185: Hoare triple {5040#(<= ~counter~0 39)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:50,122 INFO L281 TraceCheckUtils]: 184: Hoare triple {5040#(<= ~counter~0 39)} assume !!(0 != main_~r~0); {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:50,122 INFO L281 TraceCheckUtils]: 183: Hoare triple {5040#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:50,123 INFO L281 TraceCheckUtils]: 182: Hoare triple {5040#(<= ~counter~0 39)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:50,123 INFO L281 TraceCheckUtils]: 181: Hoare triple {5024#(<= ~counter~0 38)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5040#(<= ~counter~0 39)} is VALID [2021-09-13 14:28:50,123 INFO L281 TraceCheckUtils]: 180: Hoare triple {5024#(<= ~counter~0 38)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:50,124 INFO L281 TraceCheckUtils]: 179: Hoare triple {5024#(<= ~counter~0 38)} assume !!(0 != main_~r~0); {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:50,124 INFO L281 TraceCheckUtils]: 178: Hoare triple {5024#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:50,124 INFO L281 TraceCheckUtils]: 177: Hoare triple {5024#(<= ~counter~0 38)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:50,125 INFO L281 TraceCheckUtils]: 176: Hoare triple {5008#(<= ~counter~0 37)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5024#(<= ~counter~0 38)} is VALID [2021-09-13 14:28:50,125 INFO L281 TraceCheckUtils]: 175: Hoare triple {5008#(<= ~counter~0 37)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:50,125 INFO L281 TraceCheckUtils]: 174: Hoare triple {5008#(<= ~counter~0 37)} assume !!(0 != main_~r~0); {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:50,126 INFO L281 TraceCheckUtils]: 173: Hoare triple {5008#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:50,126 INFO L281 TraceCheckUtils]: 172: Hoare triple {5008#(<= ~counter~0 37)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:50,126 INFO L281 TraceCheckUtils]: 171: Hoare triple {4992#(<= ~counter~0 36)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5008#(<= ~counter~0 37)} is VALID [2021-09-13 14:28:50,127 INFO L281 TraceCheckUtils]: 170: Hoare triple {4992#(<= ~counter~0 36)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:50,127 INFO L281 TraceCheckUtils]: 169: Hoare triple {4992#(<= ~counter~0 36)} assume !!(0 != main_~r~0); {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:50,127 INFO L281 TraceCheckUtils]: 168: Hoare triple {4992#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:50,128 INFO L281 TraceCheckUtils]: 167: Hoare triple {4992#(<= ~counter~0 36)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:50,128 INFO L281 TraceCheckUtils]: 166: Hoare triple {4976#(<= ~counter~0 35)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4992#(<= ~counter~0 36)} is VALID [2021-09-13 14:28:50,128 INFO L281 TraceCheckUtils]: 165: Hoare triple {4976#(<= ~counter~0 35)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:50,129 INFO L281 TraceCheckUtils]: 164: Hoare triple {4976#(<= ~counter~0 35)} assume !!(0 != main_~r~0); {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:50,129 INFO L281 TraceCheckUtils]: 163: Hoare triple {4976#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:50,129 INFO L281 TraceCheckUtils]: 162: Hoare triple {4976#(<= ~counter~0 35)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:50,130 INFO L281 TraceCheckUtils]: 161: Hoare triple {4960#(<= ~counter~0 34)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4976#(<= ~counter~0 35)} is VALID [2021-09-13 14:28:50,130 INFO L281 TraceCheckUtils]: 160: Hoare triple {4960#(<= ~counter~0 34)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:50,130 INFO L281 TraceCheckUtils]: 159: Hoare triple {4960#(<= ~counter~0 34)} assume !!(0 != main_~r~0); {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:50,131 INFO L281 TraceCheckUtils]: 158: Hoare triple {4960#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:50,131 INFO L281 TraceCheckUtils]: 157: Hoare triple {4960#(<= ~counter~0 34)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:50,131 INFO L281 TraceCheckUtils]: 156: Hoare triple {4944#(<= ~counter~0 33)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4960#(<= ~counter~0 34)} is VALID [2021-09-13 14:28:50,132 INFO L281 TraceCheckUtils]: 155: Hoare triple {4944#(<= ~counter~0 33)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:50,132 INFO L281 TraceCheckUtils]: 154: Hoare triple {4944#(<= ~counter~0 33)} assume !!(0 != main_~r~0); {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:50,132 INFO L281 TraceCheckUtils]: 153: Hoare triple {4944#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:50,133 INFO L281 TraceCheckUtils]: 152: Hoare triple {4944#(<= ~counter~0 33)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:50,133 INFO L281 TraceCheckUtils]: 151: Hoare triple {4928#(<= ~counter~0 32)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4944#(<= ~counter~0 33)} is VALID [2021-09-13 14:28:50,133 INFO L281 TraceCheckUtils]: 150: Hoare triple {4928#(<= ~counter~0 32)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:50,134 INFO L281 TraceCheckUtils]: 149: Hoare triple {4928#(<= ~counter~0 32)} assume !!(0 != main_~r~0); {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:50,134 INFO L281 TraceCheckUtils]: 148: Hoare triple {4928#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:50,134 INFO L281 TraceCheckUtils]: 147: Hoare triple {4928#(<= ~counter~0 32)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:50,135 INFO L281 TraceCheckUtils]: 146: Hoare triple {4912#(<= ~counter~0 31)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4928#(<= ~counter~0 32)} is VALID [2021-09-13 14:28:50,135 INFO L281 TraceCheckUtils]: 145: Hoare triple {4912#(<= ~counter~0 31)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:50,135 INFO L281 TraceCheckUtils]: 144: Hoare triple {4912#(<= ~counter~0 31)} assume !!(0 != main_~r~0); {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:50,136 INFO L281 TraceCheckUtils]: 143: Hoare triple {4912#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:50,136 INFO L281 TraceCheckUtils]: 142: Hoare triple {4912#(<= ~counter~0 31)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:50,137 INFO L281 TraceCheckUtils]: 141: Hoare triple {4896#(<= ~counter~0 30)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4912#(<= ~counter~0 31)} is VALID [2021-09-13 14:28:50,137 INFO L281 TraceCheckUtils]: 140: Hoare triple {4896#(<= ~counter~0 30)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:50,137 INFO L281 TraceCheckUtils]: 139: Hoare triple {4896#(<= ~counter~0 30)} assume !!(0 != main_~r~0); {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:50,137 INFO L281 TraceCheckUtils]: 138: Hoare triple {4896#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:50,138 INFO L281 TraceCheckUtils]: 137: Hoare triple {4896#(<= ~counter~0 30)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:50,138 INFO L281 TraceCheckUtils]: 136: Hoare triple {4880#(<= ~counter~0 29)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4896#(<= ~counter~0 30)} is VALID [2021-09-13 14:28:50,139 INFO L281 TraceCheckUtils]: 135: Hoare triple {4880#(<= ~counter~0 29)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:50,139 INFO L281 TraceCheckUtils]: 134: Hoare triple {4880#(<= ~counter~0 29)} assume !!(0 != main_~r~0); {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:50,139 INFO L281 TraceCheckUtils]: 133: Hoare triple {4880#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:50,139 INFO L281 TraceCheckUtils]: 132: Hoare triple {4880#(<= ~counter~0 29)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:50,140 INFO L281 TraceCheckUtils]: 131: Hoare triple {4864#(<= ~counter~0 28)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4880#(<= ~counter~0 29)} is VALID [2021-09-13 14:28:50,140 INFO L281 TraceCheckUtils]: 130: Hoare triple {4864#(<= ~counter~0 28)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:50,141 INFO L281 TraceCheckUtils]: 129: Hoare triple {4864#(<= ~counter~0 28)} assume !!(0 != main_~r~0); {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:50,141 INFO L281 TraceCheckUtils]: 128: Hoare triple {4864#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:50,141 INFO L281 TraceCheckUtils]: 127: Hoare triple {4864#(<= ~counter~0 28)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:50,142 INFO L281 TraceCheckUtils]: 126: Hoare triple {4848#(<= ~counter~0 27)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4864#(<= ~counter~0 28)} is VALID [2021-09-13 14:28:50,142 INFO L281 TraceCheckUtils]: 125: Hoare triple {4848#(<= ~counter~0 27)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:50,142 INFO L281 TraceCheckUtils]: 124: Hoare triple {4848#(<= ~counter~0 27)} assume !!(0 != main_~r~0); {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:50,143 INFO L281 TraceCheckUtils]: 123: Hoare triple {4848#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:50,143 INFO L281 TraceCheckUtils]: 122: Hoare triple {4848#(<= ~counter~0 27)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:50,143 INFO L281 TraceCheckUtils]: 121: Hoare triple {4832#(<= ~counter~0 26)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4848#(<= ~counter~0 27)} is VALID [2021-09-13 14:28:50,144 INFO L281 TraceCheckUtils]: 120: Hoare triple {4832#(<= ~counter~0 26)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:50,144 INFO L281 TraceCheckUtils]: 119: Hoare triple {4832#(<= ~counter~0 26)} assume !!(0 != main_~r~0); {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:50,144 INFO L281 TraceCheckUtils]: 118: Hoare triple {4832#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:50,145 INFO L281 TraceCheckUtils]: 117: Hoare triple {4832#(<= ~counter~0 26)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:50,145 INFO L281 TraceCheckUtils]: 116: Hoare triple {4816#(<= ~counter~0 25)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4832#(<= ~counter~0 26)} is VALID [2021-09-13 14:28:50,145 INFO L281 TraceCheckUtils]: 115: Hoare triple {4816#(<= ~counter~0 25)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:50,146 INFO L281 TraceCheckUtils]: 114: Hoare triple {4816#(<= ~counter~0 25)} assume !!(0 != main_~r~0); {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:50,146 INFO L281 TraceCheckUtils]: 113: Hoare triple {4816#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:50,146 INFO L281 TraceCheckUtils]: 112: Hoare triple {4816#(<= ~counter~0 25)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:50,147 INFO L281 TraceCheckUtils]: 111: Hoare triple {4800#(<= ~counter~0 24)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4816#(<= ~counter~0 25)} is VALID [2021-09-13 14:28:50,147 INFO L281 TraceCheckUtils]: 110: Hoare triple {4800#(<= ~counter~0 24)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:50,147 INFO L281 TraceCheckUtils]: 109: Hoare triple {4800#(<= ~counter~0 24)} assume !!(0 != main_~r~0); {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:50,147 INFO L281 TraceCheckUtils]: 108: Hoare triple {4800#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:50,148 INFO L281 TraceCheckUtils]: 107: Hoare triple {4800#(<= ~counter~0 24)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:50,148 INFO L281 TraceCheckUtils]: 106: Hoare triple {4784#(<= ~counter~0 23)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4800#(<= ~counter~0 24)} is VALID [2021-09-13 14:28:50,148 INFO L281 TraceCheckUtils]: 105: Hoare triple {4784#(<= ~counter~0 23)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:50,149 INFO L281 TraceCheckUtils]: 104: Hoare triple {4784#(<= ~counter~0 23)} assume !!(0 != main_~r~0); {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:50,149 INFO L281 TraceCheckUtils]: 103: Hoare triple {4784#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:50,149 INFO L281 TraceCheckUtils]: 102: Hoare triple {4784#(<= ~counter~0 23)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:50,150 INFO L281 TraceCheckUtils]: 101: Hoare triple {4768#(<= ~counter~0 22)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4784#(<= ~counter~0 23)} is VALID [2021-09-13 14:28:50,150 INFO L281 TraceCheckUtils]: 100: Hoare triple {4768#(<= ~counter~0 22)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:50,150 INFO L281 TraceCheckUtils]: 99: Hoare triple {4768#(<= ~counter~0 22)} assume !!(0 != main_~r~0); {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:50,150 INFO L281 TraceCheckUtils]: 98: Hoare triple {4768#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:50,151 INFO L281 TraceCheckUtils]: 97: Hoare triple {4768#(<= ~counter~0 22)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:50,151 INFO L281 TraceCheckUtils]: 96: Hoare triple {4752#(<= ~counter~0 21)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4768#(<= ~counter~0 22)} is VALID [2021-09-13 14:28:50,151 INFO L281 TraceCheckUtils]: 95: Hoare triple {4752#(<= ~counter~0 21)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:50,152 INFO L281 TraceCheckUtils]: 94: Hoare triple {4752#(<= ~counter~0 21)} assume !!(0 != main_~r~0); {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:50,152 INFO L281 TraceCheckUtils]: 93: Hoare triple {4752#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:50,152 INFO L281 TraceCheckUtils]: 92: Hoare triple {4752#(<= ~counter~0 21)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:50,153 INFO L281 TraceCheckUtils]: 91: Hoare triple {4736#(<= ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4752#(<= ~counter~0 21)} is VALID [2021-09-13 14:28:50,153 INFO L281 TraceCheckUtils]: 90: Hoare triple {4736#(<= ~counter~0 20)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:50,153 INFO L281 TraceCheckUtils]: 89: Hoare triple {4736#(<= ~counter~0 20)} assume !!(0 != main_~r~0); {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:50,153 INFO L281 TraceCheckUtils]: 88: Hoare triple {4736#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:50,154 INFO L281 TraceCheckUtils]: 87: Hoare triple {4736#(<= ~counter~0 20)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:50,154 INFO L281 TraceCheckUtils]: 86: Hoare triple {4720#(<= ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4736#(<= ~counter~0 20)} is VALID [2021-09-13 14:28:50,154 INFO L281 TraceCheckUtils]: 85: Hoare triple {4720#(<= ~counter~0 19)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:50,155 INFO L281 TraceCheckUtils]: 84: Hoare triple {4720#(<= ~counter~0 19)} assume !!(0 != main_~r~0); {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:50,155 INFO L281 TraceCheckUtils]: 83: Hoare triple {4720#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:50,155 INFO L281 TraceCheckUtils]: 82: Hoare triple {4720#(<= ~counter~0 19)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:50,156 INFO L281 TraceCheckUtils]: 81: Hoare triple {4704#(<= ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4720#(<= ~counter~0 19)} is VALID [2021-09-13 14:28:50,156 INFO L281 TraceCheckUtils]: 80: Hoare triple {4704#(<= ~counter~0 18)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:50,156 INFO L281 TraceCheckUtils]: 79: Hoare triple {4704#(<= ~counter~0 18)} assume !!(0 != main_~r~0); {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:50,157 INFO L281 TraceCheckUtils]: 78: Hoare triple {4704#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:50,157 INFO L281 TraceCheckUtils]: 77: Hoare triple {4704#(<= ~counter~0 18)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:50,157 INFO L281 TraceCheckUtils]: 76: Hoare triple {4688#(<= ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4704#(<= ~counter~0 18)} is VALID [2021-09-13 14:28:50,157 INFO L281 TraceCheckUtils]: 75: Hoare triple {4688#(<= ~counter~0 17)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:50,158 INFO L281 TraceCheckUtils]: 74: Hoare triple {4688#(<= ~counter~0 17)} assume !!(0 != main_~r~0); {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:50,158 INFO L281 TraceCheckUtils]: 73: Hoare triple {4688#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:50,158 INFO L281 TraceCheckUtils]: 72: Hoare triple {4688#(<= ~counter~0 17)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:50,159 INFO L281 TraceCheckUtils]: 71: Hoare triple {4672#(<= ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4688#(<= ~counter~0 17)} is VALID [2021-09-13 14:28:50,159 INFO L281 TraceCheckUtils]: 70: Hoare triple {4672#(<= ~counter~0 16)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:50,159 INFO L281 TraceCheckUtils]: 69: Hoare triple {4672#(<= ~counter~0 16)} assume !!(0 != main_~r~0); {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:50,160 INFO L281 TraceCheckUtils]: 68: Hoare triple {4672#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:50,160 INFO L281 TraceCheckUtils]: 67: Hoare triple {4672#(<= ~counter~0 16)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:50,160 INFO L281 TraceCheckUtils]: 66: Hoare triple {4656#(<= ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4672#(<= ~counter~0 16)} is VALID [2021-09-13 14:28:50,161 INFO L281 TraceCheckUtils]: 65: Hoare triple {4656#(<= ~counter~0 15)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:50,161 INFO L281 TraceCheckUtils]: 64: Hoare triple {4656#(<= ~counter~0 15)} assume !!(0 != main_~r~0); {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:50,161 INFO L281 TraceCheckUtils]: 63: Hoare triple {4656#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:50,161 INFO L281 TraceCheckUtils]: 62: Hoare triple {4656#(<= ~counter~0 15)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:50,162 INFO L281 TraceCheckUtils]: 61: Hoare triple {4640#(<= ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4656#(<= ~counter~0 15)} is VALID [2021-09-13 14:28:50,162 INFO L281 TraceCheckUtils]: 60: Hoare triple {4640#(<= ~counter~0 14)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:50,162 INFO L281 TraceCheckUtils]: 59: Hoare triple {4640#(<= ~counter~0 14)} assume !!(0 != main_~r~0); {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:50,163 INFO L281 TraceCheckUtils]: 58: Hoare triple {4640#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:50,163 INFO L281 TraceCheckUtils]: 57: Hoare triple {4640#(<= ~counter~0 14)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:50,163 INFO L281 TraceCheckUtils]: 56: Hoare triple {4624#(<= ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4640#(<= ~counter~0 14)} is VALID [2021-09-13 14:28:50,164 INFO L281 TraceCheckUtils]: 55: Hoare triple {4624#(<= ~counter~0 13)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:50,164 INFO L281 TraceCheckUtils]: 54: Hoare triple {4624#(<= ~counter~0 13)} assume !!(0 != main_~r~0); {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:50,164 INFO L281 TraceCheckUtils]: 53: Hoare triple {4624#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:50,164 INFO L281 TraceCheckUtils]: 52: Hoare triple {4624#(<= ~counter~0 13)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:50,165 INFO L281 TraceCheckUtils]: 51: Hoare triple {4608#(<= ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4624#(<= ~counter~0 13)} is VALID [2021-09-13 14:28:50,165 INFO L281 TraceCheckUtils]: 50: Hoare triple {4608#(<= ~counter~0 12)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:50,165 INFO L281 TraceCheckUtils]: 49: Hoare triple {4608#(<= ~counter~0 12)} assume !!(0 != main_~r~0); {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:50,166 INFO L281 TraceCheckUtils]: 48: Hoare triple {4608#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:50,166 INFO L281 TraceCheckUtils]: 47: Hoare triple {4608#(<= ~counter~0 12)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:50,166 INFO L281 TraceCheckUtils]: 46: Hoare triple {4592#(<= ~counter~0 11)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4608#(<= ~counter~0 12)} is VALID [2021-09-13 14:28:50,167 INFO L281 TraceCheckUtils]: 45: Hoare triple {4592#(<= ~counter~0 11)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:50,167 INFO L281 TraceCheckUtils]: 44: Hoare triple {4592#(<= ~counter~0 11)} assume !!(0 != main_~r~0); {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:50,167 INFO L281 TraceCheckUtils]: 43: Hoare triple {4592#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:50,167 INFO L281 TraceCheckUtils]: 42: Hoare triple {4592#(<= ~counter~0 11)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:50,168 INFO L281 TraceCheckUtils]: 41: Hoare triple {4576#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4592#(<= ~counter~0 11)} is VALID [2021-09-13 14:28:50,168 INFO L281 TraceCheckUtils]: 40: Hoare triple {4576#(<= ~counter~0 10)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:50,168 INFO L281 TraceCheckUtils]: 39: Hoare triple {4576#(<= ~counter~0 10)} assume !!(0 != main_~r~0); {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:50,169 INFO L281 TraceCheckUtils]: 38: Hoare triple {4576#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:50,169 INFO L281 TraceCheckUtils]: 37: Hoare triple {4576#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:50,169 INFO L281 TraceCheckUtils]: 36: Hoare triple {4560#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4576#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:50,170 INFO L281 TraceCheckUtils]: 35: Hoare triple {4560#(<= ~counter~0 9)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:50,170 INFO L281 TraceCheckUtils]: 34: Hoare triple {4560#(<= ~counter~0 9)} assume !!(0 != main_~r~0); {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:50,170 INFO L281 TraceCheckUtils]: 33: Hoare triple {4560#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:50,170 INFO L281 TraceCheckUtils]: 32: Hoare triple {4560#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:50,171 INFO L281 TraceCheckUtils]: 31: Hoare triple {4544#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4560#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:50,171 INFO L281 TraceCheckUtils]: 30: Hoare triple {4544#(<= ~counter~0 8)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:50,171 INFO L281 TraceCheckUtils]: 29: Hoare triple {4544#(<= ~counter~0 8)} assume !!(0 != main_~r~0); {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:50,172 INFO L281 TraceCheckUtils]: 28: Hoare triple {4544#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:50,172 INFO L281 TraceCheckUtils]: 27: Hoare triple {4544#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:50,172 INFO L281 TraceCheckUtils]: 26: Hoare triple {4528#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4544#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:50,173 INFO L281 TraceCheckUtils]: 25: Hoare triple {4528#(<= ~counter~0 7)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:50,173 INFO L281 TraceCheckUtils]: 24: Hoare triple {4528#(<= ~counter~0 7)} assume !!(0 != main_~r~0); {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:50,173 INFO L281 TraceCheckUtils]: 23: Hoare triple {4528#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:50,173 INFO L281 TraceCheckUtils]: 22: Hoare triple {4528#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:50,174 INFO L281 TraceCheckUtils]: 21: Hoare triple {4512#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4528#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:50,174 INFO L281 TraceCheckUtils]: 20: Hoare triple {4512#(<= ~counter~0 6)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:50,174 INFO L281 TraceCheckUtils]: 19: Hoare triple {4512#(<= ~counter~0 6)} assume !!(0 != main_~r~0); {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:50,175 INFO L281 TraceCheckUtils]: 18: Hoare triple {4512#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:50,175 INFO L281 TraceCheckUtils]: 17: Hoare triple {4512#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:50,175 INFO L281 TraceCheckUtils]: 16: Hoare triple {4496#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4512#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:50,176 INFO L281 TraceCheckUtils]: 15: Hoare triple {4496#(<= ~counter~0 5)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:50,176 INFO L281 TraceCheckUtils]: 14: Hoare triple {4496#(<= ~counter~0 5)} assume !!(0 != main_~r~0); {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:50,176 INFO L281 TraceCheckUtils]: 13: Hoare triple {4496#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:50,176 INFO L281 TraceCheckUtils]: 12: Hoare triple {4496#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:50,177 INFO L281 TraceCheckUtils]: 11: Hoare triple {4480#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4496#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:50,177 INFO L281 TraceCheckUtils]: 10: Hoare triple {4480#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:50,177 INFO L281 TraceCheckUtils]: 9: Hoare triple {4480#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:50,178 INFO L281 TraceCheckUtils]: 8: Hoare triple {4480#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:50,178 INFO L281 TraceCheckUtils]: 7: Hoare triple {4480#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:50,178 INFO L281 TraceCheckUtils]: 6: Hoare triple {4464#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4480#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:50,179 INFO L281 TraceCheckUtils]: 5: Hoare triple {4464#(<= ~counter~0 3)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:50,179 INFO L281 TraceCheckUtils]: 4: Hoare triple {4464#(<= ~counter~0 3)} assume !(0 == assume_abort_if_not_~cond); {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:50,179 INFO L281 TraceCheckUtils]: 3: Hoare triple {4464#(<= ~counter~0 3)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:50,179 INFO L281 TraceCheckUtils]: 2: Hoare triple {4464#(<= ~counter~0 3)} assume !(0 == assume_abort_if_not_~cond); {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:50,180 INFO L281 TraceCheckUtils]: 1: Hoare triple {4464#(<= ~counter~0 3)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:50,180 INFO L281 TraceCheckUtils]: 0: Hoare triple {4408#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {4464#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:50,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:50,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907701466] [2021-09-13 14:28:50,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:50,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037480534] [2021-09-13 14:28:50,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037480534] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:50,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:50,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 53 [2021-09-13 14:28:50,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705754069] [2021-09-13 14:28:50,184 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 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 241 [2021-09-13 14:28:50,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:50,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call 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:50,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:50,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-09-13 14:28:50,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-09-13 14:28:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2021-09-13 14:28:50,364 INFO L87 Difference]: Start difference. First operand 242 states and 288 transitions. Second operand has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call 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:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:52,055 INFO L93 Difference]: Finished difference Result 266 states and 319 transitions. [2021-09-13 14:28:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-09-13 14:28:52,056 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 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 241 [2021-09-13 14:28:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call 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:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 319 transitions. [2021-09-13 14:28:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call 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:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 319 transitions. [2021-09-13 14:28:52,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states and 319 transitions. [2021-09-13 14:28:52,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:52,238 INFO L225 Difference]: With dead ends: 266 [2021-09-13 14:28:52,238 INFO L226 Difference]: Without dead ends: 262 [2021-09-13 14:28:52,240 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1743.82ms TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2021-09-13 14:28:52,242 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 248.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.97ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 250.89ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:52,242 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 3.97ms Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 250.89ms Time] [2021-09-13 14:28:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-09-13 14:28:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-09-13 14:28:52,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:52,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 262 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call 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:52,499 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 262 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call 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:52,499 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 262 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call 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:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:52,503 INFO L93 Difference]: Finished difference Result 262 states and 312 transitions. [2021-09-13 14:28:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 312 transitions. [2021-09-13 14:28:52,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:52,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:52,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 0 states have call successors, (0), 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 262 states. [2021-09-13 14:28:52,504 INFO L87 Difference]: Start difference. First operand has 262 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 0 states have call successors, (0), 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 262 states. [2021-09-13 14:28:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:52,508 INFO L93 Difference]: Finished difference Result 262 states and 312 transitions. [2021-09-13 14:28:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 312 transitions. [2021-09-13 14:28:52,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:52,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:52,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:52,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.1954022988505748) internal successors, (312), 261 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call 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:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 312 transitions. [2021-09-13 14:28:52,513 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 312 transitions. Word has length 241 [2021-09-13 14:28:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:52,513 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 312 transitions. [2021-09-13 14:28:52,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.888888888888889) internal successors, (264), 53 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call 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:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 312 transitions. [2021-09-13 14:28:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-09-13 14:28:52,515 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:52,516 INFO L513 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:52,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:52,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:52,723 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash -64907413, now seen corresponding path program 6 times [2021-09-13 14:28:52,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:52,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526360681] [2021-09-13 14:28:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:52,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:52,745 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:52,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308255504] [2021-09-13 14:28:52,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-09-13 14:28:52,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:52,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:52,747 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:28:52,748 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:29:32,719 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2021-09-13 14:29:32,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-09-13 14:29:32,719 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-13 14:29:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-13 14:29:33,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-13 14:29:33,135 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-09-13 14:29:33,136 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-09-13 14:29:33,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-09-13 14:29:33,168 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:29:33,367 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,SelfDestructingSolverStorable9 [2021-09-13 14:29:33,377 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:29:33,635 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2021-09-13 14:29:33,636 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:29:33,637 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2021-09-13 14:29:33,638 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2021-09-13 14:29:33,638 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2021-09-13 14:29:33,638 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:29:33,638 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:29:33,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:29:33 BoogieIcfgContainer [2021-09-13 14:29:33,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:29:33,639 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:29:33,639 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:29:33,639 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:29:33,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:28:18" (3/4) ... [2021-09-13 14:29:33,641 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-13 14:29:33,749 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:29:33,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:29:33,751 INFO L158 Benchmark]: Toolchain (without parser) took 75500.27ms. Allocated memory was 58.7MB in the beginning and 174.1MB in the end (delta: 115.3MB). Free memory was 37.7MB in the beginning and 69.7MB in the end (delta: -32.0MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,751 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:29:33,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.64ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 42.8MB in the end (delta: -5.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.19ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 42.6MB in the beginning and 64.3MB in the end (delta: -21.6MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,752 INFO L158 Benchmark]: Boogie Preprocessor took 34.30ms. Allocated memory is still 81.8MB. Free memory was 64.3MB in the beginning and 63.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,752 INFO L158 Benchmark]: RCFGBuilder took 290.30ms. Allocated memory is still 81.8MB. Free memory was 63.1MB in the beginning and 53.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,755 INFO L158 Benchmark]: TraceAbstraction took 74861.53ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 52.5MB in the beginning and 109.5MB in the end (delta: -57.1MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,756 INFO L158 Benchmark]: Witness Printer took 111.15ms. Allocated memory is still 174.1MB. Free memory was 109.5MB in the beginning and 69.7MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-09-13 14:29:33,757 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 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.64ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 42.8MB in the end (delta: -5.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.19ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 42.6MB in the beginning and 64.3MB in the end (delta: -21.6MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.30ms. Allocated memory is still 81.8MB. Free memory was 64.3MB in the beginning and 63.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 290.30ms. Allocated memory is still 81.8MB. Free memory was 63.1MB in the beginning and 53.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 74861.53ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 52.5MB in the beginning and 109.5MB in the end (delta: -57.1MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * Witness Printer took 111.15ms. Allocated memory is still 174.1MB. Free memory was 109.5MB in the beginning and 69.7MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L9] COND FALSE !(!cond) VAL [counter=0] [L9] COND FALSE !(!cond) VAL [counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [counter=0] [L34] EXPR counter++ VAL [counter=1] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=1] [L36] COND FALSE !(!(r != 0)) VAL [counter=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=1] [L34] EXPR counter++ VAL [counter=2] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=2] [L36] COND FALSE !(!(r != 0)) VAL [counter=2] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=2] [L34] EXPR counter++ VAL [counter=3] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=3] [L36] COND FALSE !(!(r != 0)) VAL [counter=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=3] [L34] EXPR counter++ VAL [counter=4] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=4] [L36] COND FALSE !(!(r != 0)) VAL [counter=4] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=4] [L34] EXPR counter++ VAL [counter=5] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=5] [L36] COND FALSE !(!(r != 0)) VAL [counter=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=5] [L34] EXPR counter++ VAL [counter=6] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=6] [L36] COND FALSE !(!(r != 0)) VAL [counter=6] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=6] [L34] EXPR counter++ VAL [counter=7] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=7] [L36] COND FALSE !(!(r != 0)) VAL [counter=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=7] [L34] EXPR counter++ VAL [counter=8] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=8] [L36] COND FALSE !(!(r != 0)) VAL [counter=8] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=8] [L34] EXPR counter++ VAL [counter=9] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=9] [L36] COND FALSE !(!(r != 0)) VAL [counter=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=9] [L34] EXPR counter++ VAL [counter=10] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=10] [L36] COND FALSE !(!(r != 0)) VAL [counter=10] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=10] [L34] EXPR counter++ VAL [counter=11] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=11] [L36] COND FALSE !(!(r != 0)) VAL [counter=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=11] [L34] EXPR counter++ VAL [counter=12] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=12] [L36] COND FALSE !(!(r != 0)) VAL [counter=12] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=12] [L34] EXPR counter++ VAL [counter=13] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=13] [L36] COND FALSE !(!(r != 0)) VAL [counter=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=13] [L34] EXPR counter++ VAL [counter=14] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=14] [L36] COND FALSE !(!(r != 0)) VAL [counter=14] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=14] [L34] EXPR counter++ VAL [counter=15] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=15] [L36] COND FALSE !(!(r != 0)) VAL [counter=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=15] [L34] EXPR counter++ VAL [counter=16] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=16] [L36] COND FALSE !(!(r != 0)) VAL [counter=16] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=16] [L34] EXPR counter++ VAL [counter=17] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=17] [L36] COND FALSE !(!(r != 0)) VAL [counter=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=17] [L34] EXPR counter++ VAL [counter=18] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=18] [L36] COND FALSE !(!(r != 0)) VAL [counter=18] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=18] [L34] EXPR counter++ VAL [counter=19] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=19] [L36] COND FALSE !(!(r != 0)) VAL [counter=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=19] [L34] EXPR counter++ VAL [counter=20] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=20] [L36] COND FALSE !(!(r != 0)) VAL [counter=20] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=20] [L34] EXPR counter++ VAL [counter=21] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=21] [L36] COND FALSE !(!(r != 0)) VAL [counter=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=21] [L34] EXPR counter++ VAL [counter=22] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=22] [L36] COND FALSE !(!(r != 0)) VAL [counter=22] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=22] [L34] EXPR counter++ VAL [counter=23] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=23] [L36] COND FALSE !(!(r != 0)) VAL [counter=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=23] [L34] EXPR counter++ VAL [counter=24] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=24] [L36] COND FALSE !(!(r != 0)) VAL [counter=24] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=24] [L34] EXPR counter++ VAL [counter=25] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=25] [L36] COND FALSE !(!(r != 0)) VAL [counter=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=25] [L34] EXPR counter++ VAL [counter=26] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=26] [L36] COND FALSE !(!(r != 0)) VAL [counter=26] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=26] [L34] EXPR counter++ VAL [counter=27] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=27] [L36] COND FALSE !(!(r != 0)) VAL [counter=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=27] [L34] EXPR counter++ VAL [counter=28] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=28] [L36] COND FALSE !(!(r != 0)) VAL [counter=28] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=28] [L34] EXPR counter++ VAL [counter=29] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=29] [L36] COND FALSE !(!(r != 0)) VAL [counter=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=29] [L34] EXPR counter++ VAL [counter=30] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=30] [L36] COND FALSE !(!(r != 0)) VAL [counter=30] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=30] [L34] EXPR counter++ VAL [counter=31] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=31] [L36] COND FALSE !(!(r != 0)) VAL [counter=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=31] [L34] EXPR counter++ VAL [counter=32] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=32] [L36] COND FALSE !(!(r != 0)) VAL [counter=32] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=32] [L34] EXPR counter++ VAL [counter=33] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=33] [L36] COND FALSE !(!(r != 0)) VAL [counter=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=33] [L34] EXPR counter++ VAL [counter=34] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=34] [L36] COND FALSE !(!(r != 0)) VAL [counter=34] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=34] [L34] EXPR counter++ VAL [counter=35] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=35] [L36] COND FALSE !(!(r != 0)) VAL [counter=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=35] [L34] EXPR counter++ VAL [counter=36] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=36] [L36] COND FALSE !(!(r != 0)) VAL [counter=36] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=36] [L34] EXPR counter++ VAL [counter=37] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=37] [L36] COND FALSE !(!(r != 0)) VAL [counter=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=37] [L34] EXPR counter++ VAL [counter=38] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=38] [L36] COND FALSE !(!(r != 0)) VAL [counter=38] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=38] [L34] EXPR counter++ VAL [counter=39] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=39] [L36] COND FALSE !(!(r != 0)) VAL [counter=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=39] [L34] EXPR counter++ VAL [counter=40] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=40] [L36] COND FALSE !(!(r != 0)) VAL [counter=40] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=40] [L34] EXPR counter++ VAL [counter=41] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=41] [L36] COND FALSE !(!(r != 0)) VAL [counter=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=41] [L34] EXPR counter++ VAL [counter=42] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=42] [L36] COND FALSE !(!(r != 0)) VAL [counter=42] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=42] [L34] EXPR counter++ VAL [counter=43] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=43] [L36] COND FALSE !(!(r != 0)) VAL [counter=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=43] [L34] EXPR counter++ VAL [counter=44] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=44] [L36] COND FALSE !(!(r != 0)) VAL [counter=44] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=44] [L34] EXPR counter++ VAL [counter=45] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=45] [L36] COND FALSE !(!(r != 0)) VAL [counter=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=45] [L34] EXPR counter++ VAL [counter=46] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=46] [L36] COND FALSE !(!(r != 0)) VAL [counter=46] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=46] [L34] EXPR counter++ VAL [counter=47] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=47] [L36] COND FALSE !(!(r != 0)) VAL [counter=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=47] [L34] EXPR counter++ VAL [counter=48] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=48] [L36] COND FALSE !(!(r != 0)) VAL [counter=48] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=48] [L34] EXPR counter++ VAL [counter=49] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=49] [L36] COND FALSE !(!(r != 0)) VAL [counter=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=49] [L34] EXPR counter++ VAL [counter=50] [L34] COND TRUE counter++<50 [L12] COND FALSE !(!(cond)) VAL [counter=50] [L36] COND FALSE !(!(r != 0)) VAL [counter=50] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=50] [L34] EXPR counter++ VAL [counter=51] [L34] COND FALSE !(counter++<50) [L12] COND TRUE !(cond) VAL [counter=51] [L14] reach_error() VAL [counter=51] - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 74562.62ms, OverallIterations: 10, TraceHistogramMax: 51, EmptinessCheckTime: 15.34ms, AutomataDifference: 11643.12ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 5.73ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 1758.06ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1745.52ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 868 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1231 IncrementalHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 0 mSDtfsCounter, 1231 mSolverCounterSat, 14.45ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1101 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 4024.68ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=9, InterpolantAutomatonStates: 290, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 914.60ms AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 116.89ms SsaConstructionTime, 42409.11ms SatisfiabilityAnalysisTime, 12473.56ms InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 970 ConstructedInterpolants, 0 QuantifiedInterpolants, 2934 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1952 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 0/13502 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-09-13 14:29:33,788 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...