./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.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/prodbin-ll_unwindbound5.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 c0eda672a1401330c428e19b34263886ea0c057fa2f6ccf2bc341fc3e3b3427c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:39:38,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:39:38,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:39:38,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:39:38,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:39:38,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:39:38,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:39:38,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:39:38,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:39:38,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:39:38,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:39:38,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:39:38,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:39:38,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:39:38,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:39:38,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:39:38,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:39:38,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:39:38,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:39:38,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:39:38,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:39:38,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:39:38,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:39:38,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:39:38,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:39:38,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:39:38,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:39:38,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:39:38,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:39:38,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:39:38,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:39:38,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:39:38,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:39:38,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:39:38,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:39:38,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:39:38,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:39:38,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:39:38,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:39:38,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:39:38,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:39:38,536 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:39:38,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:39:38,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:39:38,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:39:38,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:39:38,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:39:38,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:39:38,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:39:38,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:39:38,551 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:39:38,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:39:38,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:39:38,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:39:38,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:39:38,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:39:38,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:39:38,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:39:38,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:39:38,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:39:38,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:39:38,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:39:38,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:39:38,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:39:38,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:39:38,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:39:38,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:38,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:39:38,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:39:38,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:39:38,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:39:38,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:39:38,554 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:39:38,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:39:38,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:39:38,555 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 -> c0eda672a1401330c428e19b34263886ea0c057fa2f6ccf2bc341fc3e3b3427c [2022-02-20 17:39:38,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:39:38,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:39:38,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:39:38,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:39:38,754 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:39:38,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c [2022-02-20 17:39:38,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b4f9507/47a9b8d03c784deb85d2ee8c5fa1f32c/FLAG67b6444c1 [2022-02-20 17:39:39,153 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:39:39,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound5.c [2022-02-20 17:39:39,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b4f9507/47a9b8d03c784deb85d2ee8c5fa1f32c/FLAG67b6444c1 [2022-02-20 17:39:39,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b4f9507/47a9b8d03c784deb85d2ee8c5fa1f32c [2022-02-20 17:39:39,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:39:39,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:39:39,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:39,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:39:39,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:39:39,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fe0ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39, skipping insertion in model container [2022-02-20 17:39:39,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:39:39,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:39:39,286 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/prodbin-ll_unwindbound5.c[537,550] [2022-02-20 17:39:39,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:39,318 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:39:39,327 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/prodbin-ll_unwindbound5.c[537,550] [2022-02-20 17:39:39,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:39,338 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:39:39,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39 WrapperNode [2022-02-20 17:39:39,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:39,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:39,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:39:39,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:39:39,344 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:39:39" (1/1) ... [2022-02-20 17:39:39,348 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:39:39" (1/1) ... [2022-02-20 17:39:39,369 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-02-20 17:39:39,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:39,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:39:39,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:39:39,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:39:39,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:39:39,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:39:39,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:39:39,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:39:39,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (1/1) ... [2022-02-20 17:39:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:39,427 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:39:39,431 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:39:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:39:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:39:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:39:39,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:39:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:39:39,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:39:39,525 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:39:39,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:39:39,695 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:39:39,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:39:39,702 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:39:39,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:39 BoogieIcfgContainer [2022-02-20 17:39:39,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:39:39,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:39:39,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:39:39,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:39:39,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:39:39" (1/3) ... [2022-02-20 17:39:39,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687259c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:39, skipping insertion in model container [2022-02-20 17:39:39,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:39" (2/3) ... [2022-02-20 17:39:39,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687259c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:39, skipping insertion in model container [2022-02-20 17:39:39,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:39" (3/3) ... [2022-02-20 17:39:39,726 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound5.c [2022-02-20 17:39:39,729 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:39:39,729 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:39:39,769 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:39:39,774 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:39:39,774 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:39:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:39:39,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:39,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:39,818 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -572597424, now seen corresponding path program 1 times [2022-02-20 17:39:39,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:39,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817853826] [2022-02-20 17:39:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:39,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24#true} is VALID [2022-02-20 17:39:39,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {24#true} is VALID [2022-02-20 17:39:39,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {25#false} is VALID [2022-02-20 17:39:39,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {25#false} is VALID [2022-02-20 17:39:39,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 17:39:39,978 INFO L272 TraceCheckUtils]: 5: Hoare triple {25#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {25#false} is VALID [2022-02-20 17:39:39,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:39:39,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-02-20 17:39:39,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:39:39,980 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:39:39,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:39,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817853826] [2022-02-20 17:39:39,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817853826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:39,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:39,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:39:39,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791385842] [2022-02-20 17:39:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:39,989 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:39:39,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:39,993 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:39:40,009 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:39:40,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:39:40,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:39:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:39:40,034 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:39:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:40,080 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-02-20 17:39:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:39:40,081 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:39:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:40,082 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:39:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:40,088 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:39:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2022-02-20 17:39:40,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2022-02-20 17:39:40,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:40,158 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:39:40,159 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:39:40,161 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:39:40,164 INFO L933 BasicCegarLoop]: 24 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, 24 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:39:40,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:39:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:39:40,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:40,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:39:40,192 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:39:40,192 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:39:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:40,203 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:40,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:40,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:40,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:39:40,206 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:39:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:40,208 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:39:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:40,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:40,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:40,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:40,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:39:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 17:39:40,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-02-20 17:39:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:40,214 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 17:39:40,214 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:39:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:39:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:40,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:40,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:40,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:39:40,216 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1986366499, now seen corresponding path program 1 times [2022-02-20 17:39:40,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:40,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343801644] [2022-02-20 17:39:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:40,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:40,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:40,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:40,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:40,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {134#(= ~counter~0 0)} is VALID [2022-02-20 17:39:40,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {135#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:39:40,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {133#false} is VALID [2022-02-20 17:39:40,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {133#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {133#false} is VALID [2022-02-20 17:39:40,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} ~cond := #in~cond; {133#false} is VALID [2022-02-20 17:39:40,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume 0 == ~cond; {133#false} is VALID [2022-02-20 17:39:40,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 17:39:40,300 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:39:40,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:40,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343801644] [2022-02-20 17:39:40,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343801644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:40,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:40,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:39:40,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103879601] [2022-02-20 17:39:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:40,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:40,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:40,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:40,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:39:40,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:39:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:39:40,316 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:40,359 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 17:39:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:39:40,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-02-20 17:39:40,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-02-20 17:39:40,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:40,387 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:39:40,387 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:39:40,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:39:40,392 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:40,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:39:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:39:40,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:40,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 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:39:40,398 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 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:39:40,398 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 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:39:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:40,400 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:40,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:40,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:40,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 17:39:40,402 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 17:39:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:40,405 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-20 17:39:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:40,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:40,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:40,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:40,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 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:39:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 17:39:40,407 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-02-20 17:39:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:40,408 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 17:39:40,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:39:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 17:39:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:39:40,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:40,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:40,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:39:40,410 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1984579039, now seen corresponding path program 1 times [2022-02-20 17:39:40,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:40,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861900618] [2022-02-20 17:39:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:40,444 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:40,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786225448] [2022-02-20 17:39:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:40,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:40,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:40,446 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:39:40,448 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:39:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:40,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:39:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:40,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:40,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {233#true} is VALID [2022-02-20 17:39:40,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {233#true} is VALID [2022-02-20 17:39:40,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} assume !(0 == assume_abort_if_not_~cond#1); {233#true} is VALID [2022-02-20 17:39:40,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {233#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:40,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:40,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:40,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:40,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:40,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {234#false} is VALID [2022-02-20 17:39:40,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 17:39:40,737 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:39:40,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:40,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:40,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861900618] [2022-02-20 17:39:40,738 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:40,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786225448] [2022-02-20 17:39:40,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786225448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:40,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:40,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:40,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725321935] [2022-02-20 17:39:40,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:40,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:40,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:40,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:40,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:40,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:40,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:40,753 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,106 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 17:39:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:39:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:41,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:41,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:41,136 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:39:41,136 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:39:41,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:39:41,137 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:41,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:39:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-02-20 17:39:41,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:41,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,141 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,141 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,142 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:41,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:41,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:41,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 17:39:41,143 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 17:39:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,144 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:39:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 17:39:41,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:41,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:41,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:41,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:39:41,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:39:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:41,146 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:39:41,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:39:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:39:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:39:41,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:41,146 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:41,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:39:41,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:41,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash 845350648, now seen corresponding path program 1 times [2022-02-20 17:39:41,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:41,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849615051] [2022-02-20 17:39:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:41,358 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:41,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038004924] [2022-02-20 17:39:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:41,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:41,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:41,359 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:39:41,360 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:39:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:41,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:39:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:41,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:41,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {394#true} is VALID [2022-02-20 17:39:41,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {402#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:39:41,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {406#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:39:41,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {406#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:41,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:41,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:41,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {394#true} is VALID [2022-02-20 17:39:41,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#true} ~cond := #in~cond; {394#true} is VALID [2022-02-20 17:39:41,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#true} assume !(0 == ~cond); {394#true} is VALID [2022-02-20 17:39:41,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} assume true; {394#true} is VALID [2022-02-20 17:39:41,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {394#true} {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #53#return; {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:41,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_~y~0#1); {395#false} is VALID [2022-02-20 17:39:41,486 INFO L272 TraceCheckUtils]: 12: Hoare triple {395#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {395#false} is VALID [2022-02-20 17:39:41,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID [2022-02-20 17:39:41,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID [2022-02-20 17:39:41,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-02-20 17:39:41,487 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:39:41,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:41,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:41,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849615051] [2022-02-20 17:39:41,487 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:41,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038004924] [2022-02-20 17:39:41,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038004924] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:41,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:41,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:41,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831206210] [2022-02-20 17:39:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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 16 [2022-02-20 17:39:41,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:41,489 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), 5 states have internal predecessors, (13), 2 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:39:41,500 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:39:41,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:41,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:41,501 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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:39:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,599 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 17:39:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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 16 [2022-02-20 17:39:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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:39:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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:39:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 17:39:41,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 17:39:41,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:41,639 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:39:41,639 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:39:41,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:39:41,640 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:41,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:39:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-20 17:39:41,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:41,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,647 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,647 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,648 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 17:39:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:39:41,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:41,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:41,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 17:39:41,649 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-02-20 17:39:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:41,650 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-20 17:39:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:39:41,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:41,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:41,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:41,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-20 17:39:41,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-02-20 17:39:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:41,653 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-20 17:39:41,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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:39:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 17:39:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:39:41,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:41,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:41,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:39:41,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:39:41,870 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 905454657, now seen corresponding path program 1 times [2022-02-20 17:39:41,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:41,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649176030] [2022-02-20 17:39:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:41,883 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:41,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887958642] [2022-02-20 17:39:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:41,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:41,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:41,888 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:39:41,890 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:39:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:41,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:39:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:41,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:42,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {579#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:42,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:42,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:42,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {584#(<= ~counter~0 0)} is VALID [2022-02-20 17:39:42,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {584#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {597#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#(<= ~counter~0 1)} ~cond := #in~cond; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#(<= ~counter~0 1)} assume !(0 == ~cond); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(<= ~counter~0 1)} assume true; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#(<= ~counter~0 1)} {597#(<= ~counter~0 1)} #53#return; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#(<= ~counter~0 1)} assume !!(0 != main_~y~0#1); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#(<= ~counter~0 1)} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#(<= ~counter~0 1)} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {597#(<= ~counter~0 1)} is VALID [2022-02-20 17:39:42,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {597#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {628#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:39:42,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {580#false} is VALID [2022-02-20 17:39:42,110 INFO L272 TraceCheckUtils]: 16: Hoare triple {580#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {580#false} is VALID [2022-02-20 17:39:42,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {580#false} ~cond := #in~cond; {580#false} is VALID [2022-02-20 17:39:42,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#false} assume 0 == ~cond; {580#false} is VALID [2022-02-20 17:39:42,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#false} assume !false; {580#false} is VALID [2022-02-20 17:39:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:42,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:39:42,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#false} assume !false; {580#false} is VALID [2022-02-20 17:39:42,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#false} assume 0 == ~cond; {580#false} is VALID [2022-02-20 17:39:42,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {580#false} ~cond := #in~cond; {580#false} is VALID [2022-02-20 17:39:42,254 INFO L272 TraceCheckUtils]: 16: Hoare triple {580#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {580#false} is VALID [2022-02-20 17:39:42,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(< |ULTIMATE.start_main_#t~post6#1| 5)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {580#false} is VALID [2022-02-20 17:39:42,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {660#(< ~counter~0 5)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {656#(< |ULTIMATE.start_main_#t~post6#1| 5)} is VALID [2022-02-20 17:39:42,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {660#(< ~counter~0 5)} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {660#(< ~counter~0 5)} is VALID [2022-02-20 17:39:42,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {660#(< ~counter~0 5)} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {660#(< ~counter~0 5)} is VALID [2022-02-20 17:39:42,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(< ~counter~0 5)} assume !!(0 != main_~y~0#1); {660#(< ~counter~0 5)} is VALID [2022-02-20 17:39:42,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {579#true} {660#(< ~counter~0 5)} #53#return; {660#(< ~counter~0 5)} is VALID [2022-02-20 17:39:42,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {579#true} assume true; {579#true} is VALID [2022-02-20 17:39:42,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {579#true} assume !(0 == ~cond); {579#true} is VALID [2022-02-20 17:39:42,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#true} ~cond := #in~cond; {579#true} is VALID [2022-02-20 17:39:42,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {660#(< ~counter~0 5)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {579#true} is VALID [2022-02-20 17:39:42,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {660#(< ~counter~0 5)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {660#(< ~counter~0 5)} is VALID [2022-02-20 17:39:42,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {691#(< ~counter~0 4)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {660#(< ~counter~0 5)} is VALID [2022-02-20 17:39:42,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {691#(< ~counter~0 4)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {691#(< ~counter~0 4)} is VALID [2022-02-20 17:39:42,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {691#(< ~counter~0 4)} assume !(0 == assume_abort_if_not_~cond#1); {691#(< ~counter~0 4)} is VALID [2022-02-20 17:39:42,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {691#(< ~counter~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {691#(< ~counter~0 4)} is VALID [2022-02-20 17:39:42,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {579#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {691#(< ~counter~0 4)} is VALID [2022-02-20 17:39:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:42,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:42,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649176030] [2022-02-20 17:39:42,264 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:42,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887958642] [2022-02-20 17:39:42,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887958642] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:39:42,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:39:42,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:39:42,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045633082] [2022-02-20 17:39:42,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:39:42,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 17:39:42,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:42,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:42,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:42,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:39:42,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:39:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:39:42,311 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:42,515 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-02-20 17:39:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:39:42,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 17:39:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 17:39:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 17:39:42,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-02-20 17:39:42,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:42,604 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:39:42,604 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 17:39:42,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:39:42,605 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:42,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 86 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 17:39:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-02-20 17:39:42,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:42,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:42,622 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:42,623 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:42,625 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 17:39:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:39:42,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:42,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:42,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-02-20 17:39:42,626 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-02-20 17:39:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:42,627 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-02-20 17:39:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:39:42,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:42,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:42,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:42,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-02-20 17:39:42,630 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 20 [2022-02-20 17:39:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:42,630 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-02-20 17:39:42,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:39:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 17:39:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:39:42,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:42,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:42,653 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:39:42,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:42,850 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash 907242117, now seen corresponding path program 1 times [2022-02-20 17:39:42,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:42,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230493689] [2022-02-20 17:39:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:42,861 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:42,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246984683] [2022-02-20 17:39:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:42,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:42,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:42,863 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:39:42,864 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:39:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:42,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:39:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:42,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:48,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {966#true} is VALID [2022-02-20 17:39:48,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {966#true} is VALID [2022-02-20 17:39:48,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 == assume_abort_if_not_~cond#1); {966#true} is VALID [2022-02-20 17:39:48,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:48,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:48,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:48,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {966#true} is VALID [2022-02-20 17:39:48,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {993#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:48,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {993#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:39:48,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:39:48,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {997#(not (= |__VERIFIER_assert_#in~cond| 0))} {980#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #53#return; {1004#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:48,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {1004#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~y~0#1); {1008#(and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:48,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1008#(and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {1012#(and (<= 1 (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 2)) (= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-20 17:39:48,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1012#(and (<= 1 (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 2)) (= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 1)))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {1016#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:39:48,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {1016#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1016#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:39:48,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1016#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:39:49,262 INFO L272 TraceCheckUtils]: 16: Hoare triple {1016#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| (+ (- 1) |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:49,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:49,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {1030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {967#false} is VALID [2022-02-20 17:39:49,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 17:39:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:39:49,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:40:25,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 17:40:25,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {1030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {967#false} is VALID [2022-02-20 17:40:25,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:25,578 INFO L272 TraceCheckUtils]: 16: Hoare triple {1046#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:40:25,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1046#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1046#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:40:25,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1046#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:40:25,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (or (= (+ (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div |ULTIMATE.start_main_~y~0#1| 2)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (and (< |ULTIMATE.start_main_~y~0#1| 0) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0)))) (or (= (+ |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (+ 1 (div |ULTIMATE.start_main_~y~0#1| 2)))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (not (< |ULTIMATE.start_main_~y~0#1| 0))))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {1046#(= (+ |ULTIMATE.start_main_~z~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:40:25,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {1056#(and (or (= (+ (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div |ULTIMATE.start_main_~y~0#1| 2)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (and (< |ULTIMATE.start_main_~y~0#1| 0) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0)))) (or (= (+ |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (+ 1 (div |ULTIMATE.start_main_~y~0#1| 2)))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (not (< |ULTIMATE.start_main_~y~0#1| 0))))} is VALID [2022-02-20 17:40:25,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {1060#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !!(0 != main_~y~0#1); {1060#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:40:25,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {997#(not (= |__VERIFIER_assert_#in~cond| 0))} {966#true} #53#return; {1060#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:40:25,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:40:25,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:40:25,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {1076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:40:25,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {966#true} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {966#true} is VALID [2022-02-20 17:40:25,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {966#true} is VALID [2022-02-20 17:40:25,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {966#true} is VALID [2022-02-20 17:40:25,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {966#true} is VALID [2022-02-20 17:40:25,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume !(0 == assume_abort_if_not_~cond#1); {966#true} is VALID [2022-02-20 17:40:25,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {966#true} is VALID [2022-02-20 17:40:25,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {966#true} is VALID [2022-02-20 17:40:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:40:25,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:40:25,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230493689] [2022-02-20 17:40:25,773 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:40:25,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246984683] [2022-02-20 17:40:25,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246984683] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:40:25,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:40:25,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-02-20 17:40:25,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48401410] [2022-02-20 17:40:25,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:40:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 17:40:25,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:40:25,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:28,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:28,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:40:28,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:40:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:40:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:40:28,537 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:41,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:40:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:47,536 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-02-20 17:40:47,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:40:47,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-20 17:40:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:40:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-02-20 17:40:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-02-20 17:40:47,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2022-02-20 17:40:53,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 50 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:53,445 INFO L225 Difference]: With dead ends: 86 [2022-02-20 17:40:53,445 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 17:40:53,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:40:53,446 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:40:53,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 93 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-02-20 17:40:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 17:40:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2022-02-20 17:40:53,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:40:53,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 80 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:40:53,474 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 80 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:40:53,474 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 80 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:40:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:53,477 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-02-20 17:40:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-02-20 17:40:53,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:53,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:53,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 84 states. [2022-02-20 17:40:53,482 INFO L87 Difference]: Start difference. First operand has 80 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 84 states. [2022-02-20 17:40:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:53,487 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-02-20 17:40:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-02-20 17:40:53,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:53,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:53,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:40:53,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:40:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 67 states have internal predecessors, (76), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:40:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2022-02-20 17:40:53,491 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2022-02-20 17:40:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:40:53,491 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2022-02-20 17:40:53,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-02-20 17:40:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:40:53,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:40:53,492 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:40:53,529 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:40:53,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:40:53,693 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:40:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:40:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash 97895491, now seen corresponding path program 1 times [2022-02-20 17:40:53,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:40:53,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124223511] [2022-02-20 17:40:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:40:53,703 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:40:53,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501459723] [2022-02-20 17:40:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:40:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:40:53,720 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:40:53,751 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:40:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:53,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:40:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:53,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:40:57,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {1494#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1494#true} is VALID [2022-02-20 17:40:57,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~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 -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~b~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; {1502#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:40:57,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {1502#(or (and (not (<= 1 |ULTIMATE.start_main_~b~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~b~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {1506#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:40:57,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {1506#(<= 1 |ULTIMATE.start_main_~b~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:40:57,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:40:57,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:40:57,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {1494#true} is VALID [2022-02-20 17:40:57,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1494#true} ~cond := #in~cond; {1523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:57,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:40:57,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:40:57,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1527#(not (= |__VERIFIER_assert_#in~cond| 0))} {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #53#return; {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:40:57,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~y~0#1); {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:40:57,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1510#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !(1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2)); {1540#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 1)))} is VALID [2022-02-20 17:40:57,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 1)))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {1544#(and (= |ULTIMATE.start_main_~y~0#1| (div |ULTIMATE.start_main_~b~0#1| 2)) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0) (not (= (mod |ULTIMATE.start_main_~b~0#1| 2) 1)))} is VALID [2022-02-20 17:40:57,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {1544#(and (= |ULTIMATE.start_main_~y~0#1| (div |ULTIMATE.start_main_~b~0#1| 2)) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0) (not (= (mod |ULTIMATE.start_main_~b~0#1| 2) 1)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1544#(and (= |ULTIMATE.start_main_~y~0#1| (div |ULTIMATE.start_main_~b~0#1| 2)) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0) (not (= (mod |ULTIMATE.start_main_~b~0#1| 2) 1)))} is VALID [2022-02-20 17:40:57,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {1544#(and (= |ULTIMATE.start_main_~y~0#1| (div |ULTIMATE.start_main_~b~0#1| 2)) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0) (not (= (mod |ULTIMATE.start_main_~b~0#1| 2) 1)))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1544#(and (= |ULTIMATE.start_main_~y~0#1| (div |ULTIMATE.start_main_~b~0#1| 2)) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0) (not (= (mod |ULTIMATE.start_main_~b~0#1| 2) 1)))} is VALID [2022-02-20 17:40:57,037 INFO L272 TraceCheckUtils]: 16: Hoare triple {1544#(and (= |ULTIMATE.start_main_~y~0#1| (div |ULTIMATE.start_main_~b~0#1| 2)) (<= 1 |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~a~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0) (not (= (mod |ULTIMATE.start_main_~b~0#1| 2) 1)))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {1554#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:40:57,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:57,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {1558#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1495#false} is VALID [2022-02-20 17:40:57,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2022-02-20 17:40:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:40:57,038 INFO L328 TraceCheckSpWp]: Computing backward predicates...