./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 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/hard2_valuebound1.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 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:32:24,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:32:24,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:32:24,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:32:24,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:32:24,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:32:24,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:32:24,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:32:24,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:32:24,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:32:24,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:32:24,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:32:24,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:32:24,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:32:24,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:32:24,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:32:24,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:32:24,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:32:24,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:32:24,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:32:24,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:32:24,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:32:24,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:32:24,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:32:24,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:32:24,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:32:24,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:32:24,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:32:24,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:32:24,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:32:24,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:32:24,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:32:24,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:32:24,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:32:24,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:32:24,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:32:24,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:32:24,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:32:24,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:32:24,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:32:24,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:32:24,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:32:24,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:32:24,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:32:24,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:32:24,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:32:24,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:32:24,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:32:24,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:32:24,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:32:24,367 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:32:24,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:32:24,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:32:24,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:32:24,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:32:24,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:32:24,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:32:24,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:32:24,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:32:24,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:24,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:32:24,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:32:24,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:32:24,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:32:24,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:32:24,372 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:32:24,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:32:24,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:32:24,372 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 -> 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a [2022-02-20 17:32:24,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:32:24,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:32:24,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:32:24,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:32:24,611 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:32:24,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2022-02-20 17:32:24,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d82c3c5f/943f157de5e24a89aa1e232d6a0aaf58/FLAGb03b7bc3a [2022-02-20 17:32:24,988 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:32:24,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2022-02-20 17:32:25,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d82c3c5f/943f157de5e24a89aa1e232d6a0aaf58/FLAGb03b7bc3a [2022-02-20 17:32:25,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d82c3c5f/943f157de5e24a89aa1e232d6a0aaf58 [2022-02-20 17:32:25,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:32:25,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:32:25,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:25,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:32:25,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:32:25,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4b9d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25, skipping insertion in model container [2022-02-20 17:32:25,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:32:25,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:32:25,607 WARN L230 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/hard2_valuebound1.c[526,539] [2022-02-20 17:32:25,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:25,625 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:32:25,633 WARN L230 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/hard2_valuebound1.c[526,539] [2022-02-20 17:32:25,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:25,647 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:32:25,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25 WrapperNode [2022-02-20 17:32:25,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:25,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:25,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:32:25,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:32:25,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,678 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2022-02-20 17:32:25,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:25,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:32:25,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:32:25,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:32:25,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:32:25,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:32:25,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:32:25,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:32:25,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (1/1) ... [2022-02-20 17:32:25,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:25,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:25,742 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) [2022-02-20 17:32:25,757 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 [2022-02-20 17:32:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:32:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:32:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:32:25,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:32:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:32:25,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:32:25,873 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:32:25,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:32:26,063 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:32:26,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:32:26,084 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:32:26,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:26 BoogieIcfgContainer [2022-02-20 17:32:26,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:32:26,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:32:26,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:32:26,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:32:26,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:32:25" (1/3) ... [2022-02-20 17:32:26,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb776f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:26, skipping insertion in model container [2022-02-20 17:32:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:25" (2/3) ... [2022-02-20 17:32:26,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb776f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:26, skipping insertion in model container [2022-02-20 17:32:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:26" (3/3) ... [2022-02-20 17:32:26,091 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.c [2022-02-20 17:32:26,095 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:32:26,095 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:32:26,158 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:32:26,162 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 17:32:26,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:32:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:32:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:26,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:26,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:26,186 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2022-02-20 17:32:26,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:26,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877022617] [2022-02-20 17:32:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:26,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-02-20 17:32:26,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29#true} is VALID [2022-02-20 17:32:26,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {30#false} is VALID [2022-02-20 17:32:26,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {30#false} is VALID [2022-02-20 17:32:26,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:26,341 INFO L272 TraceCheckUtils]: 5: Hoare triple {30#false} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {30#false} is VALID [2022-02-20 17:32:26,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:32:26,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:32:26,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:32:26,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:26,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877022617] [2022-02-20 17:32:26,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877022617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:26,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:26,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:32:26,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621082438] [2022-02-20 17:32:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:26,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:26,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:26,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:32:26,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:32:26,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:32:26,399 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:26,450 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2022-02-20 17:32:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:32:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:26,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 17:32:26,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:26,591 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:32:26,591 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:32:26,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:32:26,596 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:26,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:32:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:32:26,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:26,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,621 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,622 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:26,627 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:26,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:26,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:26,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:32:26,628 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:32:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:26,632 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:26,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:26,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:26,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:26,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-02-20 17:32:26,636 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2022-02-20 17:32:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:26,637 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-20 17:32:26,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:26,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:26,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:26,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:32:26,638 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:26,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:26,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2022-02-20 17:32:26,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:26,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914647933] [2022-02-20 17:32:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:26,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:26,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {177#true} is VALID [2022-02-20 17:32:26,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {177#true} is VALID [2022-02-20 17:32:26,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume !(0 == assume_abort_if_not_~cond#1); {177#true} is VALID [2022-02-20 17:32:26,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {179#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:32:26,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !false; {179#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:32:26,691 INFO L272 TraceCheckUtils]: 5: Hoare triple {179#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:32:26,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {181#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:32:26,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {181#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {178#false} is VALID [2022-02-20 17:32:26,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-02-20 17:32:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:32:26,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:26,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914647933] [2022-02-20 17:32:26,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914647933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:26,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:26,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:26,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049367264] [2022-02-20 17:32:26,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:26,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:26,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:26,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:26,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:26,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:26,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:26,703 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:26,810 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-20 17:32:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:26,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:26,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:26,864 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:32:26,864 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:32:26,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:32:26,865 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:26,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:32:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-02-20 17:32:26,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:26,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,871 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,871 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:26,877 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:26,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:26,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:26,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:32:26,879 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:32:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:26,884 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:26,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:26,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:26,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:26,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 17:32:26,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-02-20 17:32:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:26,896 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 17:32:26,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 17:32:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:32:26,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:26,899 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:26,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:32:26,899 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2022-02-20 17:32:26,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:26,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870593818] [2022-02-20 17:32:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 17:32:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:26,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:26,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:26,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:26,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337#true} {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} #72#return; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:26,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {337#true} is VALID [2022-02-20 17:32:26,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {337#true} is VALID [2022-02-20 17:32:26,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume !(0 == assume_abort_if_not_~cond#1); {337#true} is VALID [2022-02-20 17:32:26,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:26,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} assume !false; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:26,992 INFO L272 TraceCheckUtils]: 5: Hoare triple {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {337#true} is VALID [2022-02-20 17:32:26,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:26,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:26,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:26,993 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {337#true} {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} #72#return; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:26,994 INFO L272 TraceCheckUtils]: 10: Hoare triple {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:32:26,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {345#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:32:26,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {338#false} is VALID [2022-02-20 17:32:26,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 17:32:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:32:26,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:26,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870593818] [2022-02-20 17:32:26,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870593818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:26,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:26,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:26,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104743537] [2022-02-20 17:32:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:32:26,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:26,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:27,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:27,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:27,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:27,010 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:27,151 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:32:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:32:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:27,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:27,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:27,211 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:32:27,211 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:32:27,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:32:27,213 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:27,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:32:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-02-20 17:32:27,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:27,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:27,217 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:27,217 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:27,219 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:27,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:27,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:27,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 17:32:27,220 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 17:32:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:27,222 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:27,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:27,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:27,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 17:32:27,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-02-20 17:32:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:27,225 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 17:32:27,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 17:32:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:32:27,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:27,225 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:27,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:32:27,226 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:27,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:27,226 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2022-02-20 17:32:27,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:27,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764156836] [2022-02-20 17:32:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:27,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:27,237 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:27,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589786404] [2022-02-20 17:32:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:27,253 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) [2022-02-20 17:32:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:27,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:32:27,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:32:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:27,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:27,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-02-20 17:32:27,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {519#true} is VALID [2022-02-20 17:32:27,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume !(0 == assume_abort_if_not_~cond#1); {519#true} is VALID [2022-02-20 17:32:27,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:27,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:27,446 INFO L272 TraceCheckUtils]: 5: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {519#true} is VALID [2022-02-20 17:32:27,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:27,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:27,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:27,447 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {519#true} {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:27,447 INFO L272 TraceCheckUtils]: 10: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {519#true} is VALID [2022-02-20 17:32:27,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:27,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:27,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:27,448 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {519#true} {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:27,449 INFO L272 TraceCheckUtils]: 15: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:27,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:27,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {520#false} is VALID [2022-02-20 17:32:27,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 17:32:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:32:27,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:27,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:27,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764156836] [2022-02-20 17:32:27,451 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:27,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589786404] [2022-02-20 17:32:27,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589786404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:27,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:27,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:27,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644923737] [2022-02-20 17:32:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:27,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:32:27,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:27,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:32:27,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:27,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:27,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:27,465 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:32:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:27,583 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-02-20 17:32:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:32:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:32:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:32:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:27,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:32:27,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:27,636 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:32:27,636 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:32:27,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:32:27,637 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:27,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:32:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:32:27,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:27,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:27,643 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:27,643 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:27,645 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:27,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:27,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:27,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 44 states. [2022-02-20 17:32:27,656 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 44 states. [2022-02-20 17:32:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:27,658 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:27,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:27,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-02-20 17:32:27,661 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2022-02-20 17:32:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:27,661 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-02-20 17:32:27,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:32:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:32:27,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:27,662 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:27,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:32:27,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:27,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2022-02-20 17:32:27,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:27,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113968168] [2022-02-20 17:32:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:27,890 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:27,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729929509] [2022-02-20 17:32:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:27,906 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) [2022-02-20 17:32:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:32:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:27,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:32:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:27,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:28,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-02-20 17:32:28,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {816#true} is VALID [2022-02-20 17:32:28,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume !(0 == assume_abort_if_not_~cond#1); {816#true} is VALID [2022-02-20 17:32:28,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {816#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,128 INFO L272 TraceCheckUtils]: 5: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:28,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:28,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:28,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:28,129 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {816#true} {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #72#return; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,130 INFO L272 TraceCheckUtils]: 10: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:28,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:28,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:28,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:28,131 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {816#true} {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #74#return; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,131 INFO L272 TraceCheckUtils]: 15: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:28,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:28,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:28,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:28,132 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {816#true} {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:28,134 INFO L272 TraceCheckUtils]: 22: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {888#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:28,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {888#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {892#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:28,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {892#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {817#false} is VALID [2022-02-20 17:32:28,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-02-20 17:32:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:32:28,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:28,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:28,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113968168] [2022-02-20 17:32:28,136 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:28,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729929509] [2022-02-20 17:32:28,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729929509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:28,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:28,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:28,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390074692] [2022-02-20 17:32:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:32:28,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:28,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:28,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:28,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:28,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:28,153 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:28,286 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 17:32:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:28,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:32:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:28,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 17:32:28,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:28,332 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:32:28,332 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:32:28,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:32:28,335 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:28,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:32:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-02-20 17:32:28,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:28,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:28,349 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:28,351 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:28,354 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:28,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:28,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:28,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-02-20 17:32:28,356 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-02-20 17:32:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:28,358 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:28,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:28,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:28,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:28,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-02-20 17:32:28,362 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2022-02-20 17:32:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:28,362 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-02-20 17:32:28,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-02-20 17:32:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:32:28,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:28,363 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:28,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:32:28,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:28,583 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash -979933353, now seen corresponding path program 1 times [2022-02-20 17:32:28,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:28,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257729006] [2022-02-20 17:32:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:28,604 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:28,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627655688] [2022-02-20 17:32:28,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:28,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:28,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:28,628 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) [2022-02-20 17:32:28,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:32:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:28,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:32:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:28,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:28,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {1150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1150#true} is VALID [2022-02-20 17:32:28,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1150#true} is VALID [2022-02-20 17:32:28,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1150#true} assume !(0 == assume_abort_if_not_~cond#1); {1150#true} is VALID [2022-02-20 17:32:28,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {1150#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,904 INFO L272 TraceCheckUtils]: 5: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:28,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:28,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:28,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:28,905 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1150#true} {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,905 INFO L272 TraceCheckUtils]: 10: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:28,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:28,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:28,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:28,907 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1150#true} {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,907 INFO L272 TraceCheckUtils]: 15: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:28,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:28,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:28,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:28,908 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1150#true} {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:28,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:28,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:28,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:28,910 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1150#true} {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,911 INFO L272 TraceCheckUtils]: 27: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:28,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:28,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:28,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:28,912 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1150#true} {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:28,913 INFO L272 TraceCheckUtils]: 32: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:28,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:28,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:28,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:32:28,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:29,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:29,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:29,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:29,068 INFO L272 TraceCheckUtils]: 32: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:29,068 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #74#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:29,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:29,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:29,069 INFO L272 TraceCheckUtils]: 27: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:29,070 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #72#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:29,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:29,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:29,070 INFO L272 TraceCheckUtils]: 22: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:29,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} assume !false; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,073 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #76#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:29,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:29,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:29,073 INFO L272 TraceCheckUtils]: 15: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:29,074 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #74#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:29,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:29,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:29,075 INFO L272 TraceCheckUtils]: 10: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:29,075 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #72#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:29,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:29,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:29,076 INFO L272 TraceCheckUtils]: 5: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:29,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} assume !false; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {1150#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:29,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {1150#true} assume !(0 == assume_abort_if_not_~cond#1); {1150#true} is VALID [2022-02-20 17:32:29,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1150#true} is VALID [2022-02-20 17:32:29,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {1150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1150#true} is VALID [2022-02-20 17:32:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-20 17:32:29,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:29,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257729006] [2022-02-20 17:32:29,078 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:29,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627655688] [2022-02-20 17:32:29,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627655688] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:32:29,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:32:29,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:32:29,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070951250] [2022-02-20 17:32:29,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 17:32:29,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:29,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:29,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:29,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:29,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:32:29,094 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:30,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:32,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,411 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-02-20 17:32:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 17:32:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:32,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:32:32,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:32,447 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:32:32,447 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:32:32,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:32:32,448 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:32,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-02-20 17:32:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:32:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-02-20 17:32:32,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:32,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:32,455 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:32,455 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,457 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:32,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-02-20 17:32:32,458 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-02-20 17:32:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,459 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:32,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:32,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-02-20 17:32:32,462 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 36 [2022-02-20 17:32:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:32,462 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-02-20 17:32:32,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-02-20 17:32:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 17:32:32,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,463 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:32,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:32:32,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:32,683 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2022-02-20 17:32:32,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:32,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237619830] [2022-02-20 17:32:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:32,702 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:32,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410459205] [2022-02-20 17:32:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:32,703 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) [2022-02-20 17:32:32,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:32:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 17:32:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:33,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-02-20 17:32:33,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1654#true} is VALID [2022-02-20 17:32:33,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume !(0 == assume_abort_if_not_~cond#1); {1654#true} is VALID [2022-02-20 17:32:33,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,137 INFO L272 TraceCheckUtils]: 5: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,138 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1654#true} {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,138 INFO L272 TraceCheckUtils]: 10: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,139 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1654#true} {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,139 INFO L272 TraceCheckUtils]: 15: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,140 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1654#true} {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,150 INFO L272 TraceCheckUtils]: 22: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,151 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,151 INFO L272 TraceCheckUtils]: 27: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,152 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,152 INFO L272 TraceCheckUtils]: 32: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,153 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 >= main_~d~0#1); {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,168 INFO L272 TraceCheckUtils]: 39: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,168 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,169 INFO L272 TraceCheckUtils]: 44: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:33,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:33,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:33,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:33,169 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,172 INFO L272 TraceCheckUtils]: 52: Hoare triple {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:33,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:33,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:33,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:32:33,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:38,954 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:38,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:38,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:38,955 INFO L272 TraceCheckUtils]: 52: Hoare triple {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:38,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} assume !false; {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:38,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:38,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:38,975 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #80#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,975 INFO L272 TraceCheckUtils]: 44: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,976 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #78#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,976 INFO L272 TraceCheckUtils]: 39: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !false; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !(main_~r~0#1 >= main_~d~0#1); {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,979 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #76#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,979 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,979 INFO L272 TraceCheckUtils]: 32: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,980 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #74#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,980 INFO L272 TraceCheckUtils]: 27: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,981 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #72#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,981 INFO L272 TraceCheckUtils]: 22: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !false; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:38,989 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1654#true} {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} #76#return; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:38,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,989 INFO L272 TraceCheckUtils]: 15: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,990 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1654#true} {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} #74#return; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:38,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,990 INFO L272 TraceCheckUtils]: 10: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,992 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1654#true} {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} #72#return; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:38,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,992 INFO L272 TraceCheckUtils]: 5: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:38,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} assume !false; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:38,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:38,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume !(0 == assume_abort_if_not_~cond#1); {1654#true} is VALID [2022-02-20 17:32:38,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1654#true} is VALID [2022-02-20 17:32:38,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-02-20 17:32:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:32:38,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:38,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237619830] [2022-02-20 17:32:38,994 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:38,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410459205] [2022-02-20 17:32:38,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410459205] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:32:38,994 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:32:38,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 17:32:38,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001161349] [2022-02-20 17:32:38,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:32:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2022-02-20 17:32:38,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:38,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:32:39,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:39,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:32:39,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:32:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:32:39,073 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:32:44,830 WARN L228 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-20 17:32:48,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:51,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:54,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:57,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:58,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:59,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:00,908 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2022-02-20 17:33:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:33:00,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2022-02-20 17:33:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:33:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:33:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:00,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-02-20 17:33:01,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:01,108 INFO L225 Difference]: With dead ends: 146 [2022-02-20 17:33:01,108 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:33:01,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:33:01,109 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 72 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:01,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 210 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 222 Invalid, 3 Unknown, 0 Unchecked, 10.4s Time] [2022-02-20 17:33:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:33:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-02-20 17:33:01,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:01,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:01,139 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:01,139 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:01,144 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:01,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:01,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:01,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) Second operand 117 states. [2022-02-20 17:33:01,147 INFO L87 Difference]: Start difference. First operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) Second operand 117 states. [2022-02-20 17:33:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:01,151 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:01,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:01,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:01,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:01,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-02-20 17:33:01,155 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 56 [2022-02-20 17:33:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:01,156 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-02-20 17:33:01,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:33:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-02-20 17:33:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:33:01,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:01,157 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:01,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:01,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:01,373 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2022-02-20 17:33:01,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:01,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634193808] [2022-02-20 17:33:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:01,391 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:01,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205692059] [2022-02-20 17:33:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:01,392 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) [2022-02-20 17:33:01,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:33:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:01,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:33:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:01,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:02,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {2598#true} is VALID [2022-02-20 17:33:02,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2598#true} is VALID [2022-02-20 17:33:02,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {2598#true} assume !(0 == assume_abort_if_not_~cond#1); {2598#true} is VALID [2022-02-20 17:33:02,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {2598#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,024 INFO L272 TraceCheckUtils]: 5: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,025 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2598#true} {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,025 INFO L272 TraceCheckUtils]: 10: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,025 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2598#true} {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,025 INFO L272 TraceCheckUtils]: 15: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,027 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2598#true} {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,028 INFO L272 TraceCheckUtils]: 22: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,029 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,029 INFO L272 TraceCheckUtils]: 27: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,030 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,030 INFO L272 TraceCheckUtils]: 32: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,031 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 >= main_~d~0#1); {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,032 INFO L272 TraceCheckUtils]: 39: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,034 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,034 INFO L272 TraceCheckUtils]: 44: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:02,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:02,034 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:02,035 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,036 INFO L272 TraceCheckUtils]: 52: Hoare triple {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {2598#true} ~cond := #in~cond; {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:02,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:02,037 INFO L290 TraceCheckUtils]: 55: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:02,038 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {2776#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:02,038 INFO L272 TraceCheckUtils]: 57: Hoare triple {2776#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:02,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {2598#true} ~cond := #in~cond; {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:02,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:02,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:02,040 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2776#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {2792#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:02,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {2792#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} assume !(1 != main_~p~0#1); {2796#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:02,041 INFO L272 TraceCheckUtils]: 63: Hoare triple {2796#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:33:02,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:02,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:02,042 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-02-20 17:33:02,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:33:14,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:14,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:14,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:14,825 INFO L272 TraceCheckUtils]: 63: Hoare triple {2820#(= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:33:14,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {2824#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} assume !(1 != main_~p~0#1); {2820#(= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:33:14,826 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2828#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (not (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} #80#return; {2824#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:14,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:14,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:14,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {2598#true} ~cond := #in~cond; {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:33:14,827 INFO L272 TraceCheckUtils]: 57: Hoare triple {2828#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (not (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,829 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2598#true} #78#return; {2828#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (not (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:14,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:14,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {2598#true} ~cond := #in~cond; {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:33:14,830 INFO L272 TraceCheckUtils]: 52: Hoare triple {2598#true} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {2598#true} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {2598#true} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2598#true} {2598#true} #80#return; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L272 TraceCheckUtils]: 44: Hoare triple {2598#true} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2598#true} {2598#true} #78#return; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L272 TraceCheckUtils]: 39: Hoare triple {2598#true} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:14,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {2598#true} assume !(main_~r~0#1 >= main_~d~0#1); {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L272 TraceCheckUtils]: 32: Hoare triple {2598#true} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L272 TraceCheckUtils]: 27: Hoare triple {2598#true} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L272 TraceCheckUtils]: 22: Hoare triple {2598#true} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {2598#true} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L272 TraceCheckUtils]: 15: Hoare triple {2598#true} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L272 TraceCheckUtils]: 10: Hoare triple {2598#true} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:14,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L272 TraceCheckUtils]: 5: Hoare triple {2598#true} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {2598#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2598#true} assume !(0 == assume_abort_if_not_~cond#1); {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {2598#true} is VALID [2022-02-20 17:33:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-20 17:33:14,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:14,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634193808] [2022-02-20 17:33:14,834 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:14,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205692059] [2022-02-20 17:33:14,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205692059] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:33:14,834 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:33:14,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-02-20 17:33:14,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649669414] [2022-02-20 17:33:14,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:33:14,834 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 67 [2022-02-20 17:33:14,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:14,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:14,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:14,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:33:14,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:33:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:33:14,889 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:15,838 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2022-02-20 17:33:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:33:15,838 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 67 [2022-02-20 17:33:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:15,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 106 transitions. [2022-02-20 17:33:15,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:15,944 INFO L225 Difference]: With dead ends: 161 [2022-02-20 17:33:15,945 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:33:15,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:33:15,945 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:15,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 181 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:33:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:33:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2022-02-20 17:33:15,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:15,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:15,964 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:15,964 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:15,967 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:15,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:15,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:15,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 107 states. [2022-02-20 17:33:15,968 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 107 states. [2022-02-20 17:33:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:15,970 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:15,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:15,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:15,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:15,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2022-02-20 17:33:15,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 67 [2022-02-20 17:33:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:15,974 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2022-02-20 17:33:15,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2022-02-20 17:33:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 17:33:15,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:15,975 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:15,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:16,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:16,191 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1842513023, now seen corresponding path program 1 times [2022-02-20 17:33:16,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:16,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523511254] [2022-02-20 17:33:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:16,202 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:16,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742441495] [2022-02-20 17:33:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:16,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:16,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:16,203 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) [2022-02-20 17:33:16,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:33:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:16,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:33:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:16,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:17,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {3592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {3592#true} is VALID [2022-02-20 17:33:17,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {3592#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3592#true} is VALID [2022-02-20 17:33:17,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {3592#true} assume !(0 == assume_abort_if_not_~cond#1); {3592#true} is VALID [2022-02-20 17:33:17,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {3592#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:17,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !false; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:17,270 INFO L272 TraceCheckUtils]: 5: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #72#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:17,270 INFO L272 TraceCheckUtils]: 10: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,271 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #74#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:17,271 INFO L272 TraceCheckUtils]: 15: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,272 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #76#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:17,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:17,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} assume !false; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:17,272 INFO L272 TraceCheckUtils]: 22: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #72#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:17,273 INFO L272 TraceCheckUtils]: 27: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,274 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #74#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:17,274 INFO L272 TraceCheckUtils]: 32: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,275 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #76#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:17,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !false; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,276 INFO L272 TraceCheckUtils]: 39: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #72#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,276 INFO L272 TraceCheckUtils]: 44: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,277 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #74#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,277 INFO L272 TraceCheckUtils]: 49: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,277 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #76#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !(main_~r~0#1 >= main_~d~0#1); {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,278 INFO L290 TraceCheckUtils]: 55: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !false; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,278 INFO L272 TraceCheckUtils]: 56: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,278 INFO L290 TraceCheckUtils]: 57: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,278 INFO L290 TraceCheckUtils]: 59: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,279 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #78#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,279 INFO L272 TraceCheckUtils]: 61: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:17,279 INFO L290 TraceCheckUtils]: 62: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:17,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:17,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:17,280 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #80#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:17,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !(1 != main_~p~0#1); {3593#false} is VALID [2022-02-20 17:33:17,280 INFO L272 TraceCheckUtils]: 67: Hoare triple {3593#false} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {3593#false} is VALID [2022-02-20 17:33:17,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:17,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {3593#false} assume !(0 == ~cond); {3593#false} is VALID [2022-02-20 17:33:17,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {3593#false} assume true; {3593#false} is VALID [2022-02-20 17:33:17,280 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3593#false} {3593#false} #82#return; {3593#false} is VALID [2022-02-20 17:33:17,281 INFO L272 TraceCheckUtils]: 72: Hoare triple {3593#false} call __VERIFIER_assert((if main_~B~0#1 == main_~d~0#1 then 1 else 0)); {3593#false} is VALID [2022-02-20 17:33:17,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:17,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {3593#false} assume 0 == ~cond; {3593#false} is VALID [2022-02-20 17:33:17,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {3593#false} assume !false; {3593#false} is VALID [2022-02-20 17:33:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-02-20 17:33:17,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:17,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:17,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523511254] [2022-02-20 17:33:17,282 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:17,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742441495] [2022-02-20 17:33:17,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742441495] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:17,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:17,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:33:17,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852503807] [2022-02-20 17:33:17,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 76 [2022-02-20 17:33:17,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:17,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:17,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:17,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:33:17,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:33:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:33:17,316 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:17,452 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-02-20 17:33:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:33:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 76 [2022-02-20 17:33:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:17,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:33:17,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:17,509 INFO L225 Difference]: With dead ends: 107 [2022-02-20 17:33:17,509 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:33:17,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:33:17,510 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:17,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:33:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:33:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 17:33:17,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:17,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:17,540 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:17,540 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:17,542 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:17,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:17,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:17,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-02-20 17:33:17,543 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-02-20 17:33:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:17,545 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:17,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:17,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:17,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:17,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2022-02-20 17:33:17,547 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 76 [2022-02-20 17:33:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:17,548 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2022-02-20 17:33:17,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:17,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:17,548 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:17,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 17:33:17,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:17,780 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2022-02-20 17:33:17,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:17,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26393151] [2022-02-20 17:33:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:17,795 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:17,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464803034] [2022-02-20 17:33:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:17,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:17,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:17,812 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) [2022-02-20 17:33:17,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:33:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:17,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:33:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:17,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:19,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {4294#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {4294#true} is VALID [2022-02-20 17:33:19,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {4294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4294#true} is VALID [2022-02-20 17:33:19,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {4294#true} assume !(0 == assume_abort_if_not_~cond#1); {4294#true} is VALID [2022-02-20 17:33:19,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {4294#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:19,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume !false; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:19,390 INFO L272 TraceCheckUtils]: 5: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,391 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4294#true} {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} #72#return; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:19,391 INFO L272 TraceCheckUtils]: 10: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,391 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4294#true} {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} #74#return; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:19,392 INFO L272 TraceCheckUtils]: 15: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,392 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4294#true} {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} #76#return; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:19,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:19,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} assume !false; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:19,393 INFO L272 TraceCheckUtils]: 22: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,394 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4294#true} {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} #72#return; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:19,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,394 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4294#true} {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} #74#return; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:19,394 INFO L272 TraceCheckUtils]: 32: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,395 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4294#true} {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} #76#return; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:19,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !false; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,396 INFO L272 TraceCheckUtils]: 39: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,397 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #72#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,397 INFO L272 TraceCheckUtils]: 44: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,398 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #74#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,398 INFO L272 TraceCheckUtils]: 49: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,398 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #76#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !false; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,399 INFO L272 TraceCheckUtils]: 56: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,400 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #78#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,400 INFO L272 TraceCheckUtils]: 61: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:19,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:19,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:19,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:19,401 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #80#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {4500#(and (<= 1 (div |ULTIMATE.start_main_~r~0#1| 2)) (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 67: Hoare triple {4500#(and (<= 1 (div |ULTIMATE.start_main_~r~0#1| 2)) (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L272 TraceCheckUtils]: 69: Hoare triple {4295#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 70: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 71: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4295#false} {4295#false} #78#return; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L272 TraceCheckUtils]: 74: Hoare triple {4295#false} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4295#false} {4295#false} #80#return; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {4295#false} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {4295#false} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:19,402 INFO L272 TraceCheckUtils]: 82: Hoare triple {4295#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {4295#false} is VALID [2022-02-20 17:33:19,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:19,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-02-20 17:33:19,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-02-20 17:33:19,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:19,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:19,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26393151] [2022-02-20 17:33:19,403 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:19,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464803034] [2022-02-20 17:33:19,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464803034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:19,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:19,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:33:19,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270257784] [2022-02-20 17:33:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-02-20 17:33:19,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:19,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:19,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:19,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:33:19,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:19,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:33:19,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:33:19,443 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:19,745 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-02-20 17:33:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:33:19,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-02-20 17:33:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:19,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-02-20 17:33:19,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:19,816 INFO L225 Difference]: With dead ends: 131 [2022-02-20 17:33:19,816 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 17:33:19,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:33:19,817 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:19,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:33:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 17:33:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2022-02-20 17:33:19,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:19,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:19,855 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:19,856 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:19,857 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:19,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:19,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:19,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 97 states. [2022-02-20 17:33:19,858 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 97 states. [2022-02-20 17:33:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:19,860 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:19,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:19,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:19,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:19,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-02-20 17:33:19,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 86 [2022-02-20 17:33:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:19,862 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-02-20 17:33:19,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-02-20 17:33:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:19,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:19,863 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:19,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:20,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:20,071 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2022-02-20 17:33:20,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:20,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698598987] [2022-02-20 17:33:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:20,093 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:20,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867562931] [2022-02-20 17:33:20,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:33:20,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:20,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:20,102 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) [2022-02-20 17:33:20,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:33:20,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:33:20,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:33:20,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:33:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:20,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:20,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {5054#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {5054#true} is VALID [2022-02-20 17:33:20,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {5054#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5062#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~A~0#1| 1) (<= 0 |ULTIMATE.start_main_~A~0#1|)) (and (or (not (<= 0 |ULTIMATE.start_main_~A~0#1|)) (not (<= |ULTIMATE.start_main_~A~0#1| 1))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:33:20,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {5062#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~A~0#1| 1) (<= 0 |ULTIMATE.start_main_~A~0#1|)) (and (or (not (<= 0 |ULTIMATE.start_main_~A~0#1|)) (not (<= |ULTIMATE.start_main_~A~0#1| 1))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {5066#(and (<= |ULTIMATE.start_main_~A~0#1| 1) (<= 0 |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:20,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {5066#(and (<= |ULTIMATE.start_main_~A~0#1| 1) (<= 0 |ULTIMATE.start_main_~A~0#1|))} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:33:20,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !false; {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:33:20,722 INFO L272 TraceCheckUtils]: 5: Hoare triple {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:20,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:20,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:20,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5054#true} {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} #72#return; {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:33:20,723 INFO L272 TraceCheckUtils]: 10: Hoare triple {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5054#true} {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} #74#return; {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:33:20,723 INFO L272 TraceCheckUtils]: 15: Hoare triple {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:20,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:20,724 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5054#true} {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} #76#return; {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:33:20,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {5070#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} assume !false; {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} is VALID [2022-02-20 17:33:20,725 INFO L272 TraceCheckUtils]: 22: Hoare triple {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5054#true} {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} #72#return; {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} is VALID [2022-02-20 17:33:20,725 INFO L272 TraceCheckUtils]: 27: Hoare triple {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:20,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:20,726 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5054#true} {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} #74#return; {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} is VALID [2022-02-20 17:33:20,726 INFO L272 TraceCheckUtils]: 32: Hoare triple {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:20,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:20,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:20,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:20,726 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5054#true} {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} #76#return; {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {5122#(and (<= |ULTIMATE.start_main_~r~0#1| 1) (<= 1 (div |ULTIMATE.start_main_~d~0#1| 2)))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L272 TraceCheckUtils]: 39: Hoare triple {5055#false} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5055#false} {5055#false} #72#return; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L272 TraceCheckUtils]: 44: Hoare triple {5055#false} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5055#false} {5055#false} #74#return; {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L272 TraceCheckUtils]: 49: Hoare triple {5055#false} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5055#false} {5055#false} #76#return; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {5055#false} assume !(main_~r~0#1 >= main_~d~0#1); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L272 TraceCheckUtils]: 56: Hoare triple {5055#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5055#false} {5055#false} #78#return; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L272 TraceCheckUtils]: 61: Hoare triple {5055#false} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {5055#false} {5055#false} #80#return; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {5055#false} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {5055#false} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L272 TraceCheckUtils]: 69: Hoare triple {5055#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,728 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5055#false} {5055#false} #78#return; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L272 TraceCheckUtils]: 74: Hoare triple {5055#false} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {5055#false} assume !(0 == ~cond); {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {5055#false} assume true; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5055#false} {5055#false} #80#return; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {5055#false} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {5055#false} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 81: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L272 TraceCheckUtils]: 82: Hoare triple {5055#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 83: Hoare triple {5055#false} ~cond := #in~cond; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 84: Hoare triple {5055#false} assume 0 == ~cond; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L290 TraceCheckUtils]: 85: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-02-20 17:33:20,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:20,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:20,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698598987] [2022-02-20 17:33:20,730 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:20,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867562931] [2022-02-20 17:33:20,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867562931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:20,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:20,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:33:20,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075360830] [2022-02-20 17:33:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:20,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 86 [2022-02-20 17:33:20,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:20,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:33:20,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:20,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:33:20,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:20,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:33:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:33:20,761 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:33:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:20,983 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-02-20 17:33:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:33:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 86 [2022-02-20 17:33:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:33:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-20 17:33:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:33:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-20 17:33:20,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-02-20 17:33:21,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:21,020 INFO L225 Difference]: With dead ends: 86 [2022-02-20 17:33:21,020 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:33:21,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:33:21,021 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:21,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:33:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:33:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:33:21,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:21,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:33:21,022 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:33:21,022 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:33:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:21,022 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:33:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:33:21,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:21,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:21,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:33:21,022 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:33:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:21,022 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:33:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:33:21,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:21,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:21,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:21,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:33:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:33:21,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2022-02-20 17:33:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:21,023 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:33:21,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:33:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:33:21,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:21,025 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:33:21,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-20 17:33:21,225 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,SelfDestructingSolverStorable10 [2022-02-20 17:33:21,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:33:21,636 INFO L861 garLoopResultBuilder]: At program point L60(lines 22 61) the Hoare annotation is: true [2022-02-20 17:33:21,636 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-02-20 17:33:21,636 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 22 61) no Hoare annotation was computed. [2022-02-20 17:33:21,636 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:33:21,636 INFO L854 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse2 (= |ULTIMATE.start_main_~B~0#1| 1))) (or (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2))) [2022-02-20 17:33:21,636 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~A~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-02-20 17:33:21,637 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:33:21,637 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:33:21,637 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:33:21,637 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse0 (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse2 (= |ULTIMATE.start_main_~B~0#1| 1))) (or (and (= (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1|) (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) .cse0 |ULTIMATE.start_main_~r~0#1|)) (= (+ |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse1 (= |ULTIMATE.start_main_~q~0#1| 1) .cse2) (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse1 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3 .cse2) (and (= 2 |ULTIMATE.start_main_~p~0#1|) (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse3 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse2))) [2022-02-20 17:33:21,637 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-02-20 17:33:21,637 INFO L854 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse0 (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse2 (= |ULTIMATE.start_main_~B~0#1| 1))) (or (and (= (+ |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~d~0#1|) (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) .cse0 |ULTIMATE.start_main_~r~0#1|)) (= (+ |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse1 (= |ULTIMATE.start_main_~q~0#1| 1) .cse2) (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse1 (= |ULTIMATE.start_main_~q~0#1| 0) .cse3 .cse2) (and (= 2 |ULTIMATE.start_main_~p~0#1|) (= .cse0 |ULTIMATE.start_main_~d~0#1|) .cse3 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse2))) [2022-02-20 17:33:21,637 INFO L858 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2022-02-20 17:33:21,637 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:33:21,637 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1)) [2022-02-20 17:33:21,638 INFO L858 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2022-02-20 17:33:21,638 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~A~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-02-20 17:33:21,638 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-02-20 17:33:21,638 INFO L854 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~A~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-02-20 17:33:21,638 INFO L854 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~A~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-02-20 17:33:21,638 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:33:21,638 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:33:21,638 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:33:21,638 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:33:21,639 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:33:21,639 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:33:21,641 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:21,642 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:33:21,644 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:33:21,644 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:33:21,644 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:33:21,644 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:33:21,644 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:33:21,644 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:33:21,645 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:33:21,646 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:33:21,664 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:33:21,664 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:33:21,664 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:33:21,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:33:21,666 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:33:21,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:33:21 BoogieIcfgContainer [2022-02-20 17:33:21,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:33:21,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:33:21,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:33:21,673 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:33:21,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:26" (3/4) ... [2022-02-20 17:33:21,676 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:33:21,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:33:21,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:33:21,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:33:21,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:33:21,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:33:21,712 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:33:21,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:33:21,714 INFO L158 Benchmark]: Toolchain (without parser) took 56285.38ms. Allocated memory was 98.6MB in the beginning and 159.4MB in the end (delta: 60.8MB). Free memory was 69.6MB in the beginning and 93.5MB in the end (delta: -23.9MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-02-20 17:33:21,714 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:33:21,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.67ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 69.4MB in the beginning and 104.0MB in the end (delta: -34.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 17:33:21,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.22ms. Allocated memory is still 130.0MB. Free memory was 104.0MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:33:21,714 INFO L158 Benchmark]: Boogie Preprocessor took 15.62ms. Allocated memory is still 130.0MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:33:21,715 INFO L158 Benchmark]: RCFGBuilder took 390.60ms. Allocated memory is still 130.0MB. Free memory was 101.0MB in the beginning and 89.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:33:21,715 INFO L158 Benchmark]: TraceAbstraction took 55586.05ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 89.4MB in the beginning and 96.7MB in the end (delta: -7.3MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2022-02-20 17:33:21,715 INFO L158 Benchmark]: Witness Printer took 39.71ms. Allocated memory is still 159.4MB. Free memory was 96.7MB in the beginning and 93.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:33:21,716 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.67ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 69.4MB in the beginning and 104.0MB in the end (delta: -34.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.22ms. Allocated memory is still 130.0MB. Free memory was 104.0MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.62ms. Allocated memory is still 130.0MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.60ms. Allocated memory is still 130.0MB. Free memory was 101.0MB in the beginning and 89.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 55586.05ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 89.4MB in the beginning and 96.7MB in the end (delta: -7.3MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * Witness Printer took 39.71ms. Allocated memory is still 159.4MB. Free memory was 96.7MB in the beginning and 93.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1142 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 794 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 782 IncrementalHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 348 mSDtfsCounter, 782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 557 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=7, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 82 PreInvPairs, 103 NumberOfFragments, 435 HoareAnnotationTreeSize, 82 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 253 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 3213 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1142 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 1820/1851 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 2 == p) && A <= 1) && B * p == d) && A == r) && d * q + r == A) && B == 1) && 0 <= A) || (((((((cond == 1 && B == d) && A <= 1) && B * p == d) && A == r) && d * q + r == A) && B == 1) && 0 <= A) RESULT: Ultimate proved your program to be correct! [2022-02-20 17:33:21,747 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE