./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_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/hard-u_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 082e5acb2a505af9e43ec1a894890509a127a32d8ecd4c5193a456bddcb0f4a3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:31:03,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:31:03,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:31:03,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:31:03,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:31:03,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:31:03,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:31:03,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:31:03,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:31:03,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:31:03,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:31:03,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:31:03,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:31:03,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:31:03,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:31:03,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:31:03,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:31:03,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:31:03,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:31:03,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:31:03,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:31:03,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:31:03,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:31:03,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:31:03,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:31:03,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:31:03,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:31:03,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:31:03,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:31:03,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:31:03,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:31:03,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:31:03,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:31:03,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:31:03,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:31:03,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:31:03,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:31:03,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:31:03,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:31:03,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:31:03,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:31:03,848 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:31:03,881 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:31:03,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:31:03,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:31:03,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:31:03,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:31:03,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:31:03,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:31:03,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:31:03,890 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:31:03,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:31:03,891 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:31:03,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:31:03,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:31:03,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:31:03,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:31:03,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:31:03,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:31:03,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:31:03,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:31:03,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:31:03,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:31:03,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:31:03,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:31:03,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:31:03,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:03,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:31:03,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:31:03,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:31:03,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:31:03,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:31:03,898 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:31:03,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:31:03,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:31:03,900 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 -> 082e5acb2a505af9e43ec1a894890509a127a32d8ecd4c5193a456bddcb0f4a3 [2022-02-20 17:31:04,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:31:04,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:31:04,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:31:04,134 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:31:04,135 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:31:04,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c [2022-02-20 17:31:04,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac072e62a/0797822ce8a443d9b1c23438078719e3/FLAG102dc69e2 [2022-02-20 17:31:04,556 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:31:04,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound5.c [2022-02-20 17:31:04,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac072e62a/0797822ce8a443d9b1c23438078719e3/FLAG102dc69e2 [2022-02-20 17:31:04,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac072e62a/0797822ce8a443d9b1c23438078719e3 [2022-02-20 17:31:04,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:31:04,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:31:04,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:04,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:31:04,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:31:04,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0f87fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04, skipping insertion in model container [2022-02-20 17:31:04,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:31:04,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:31:04,750 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/hard-u_unwindbound5.c[537,550] [2022-02-20 17:31:04,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:04,777 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:31:04,788 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/hard-u_unwindbound5.c[537,550] [2022-02-20 17:31:04,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:04,809 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:31:04,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04 WrapperNode [2022-02-20 17:31:04,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:04,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:04,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:31:04,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:31:04,817 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:31:04" (1/1) ... [2022-02-20 17:31:04,823 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:31:04" (1/1) ... [2022-02-20 17:31:04,842 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:31:04,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:04,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:31:04,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:31:04,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:31:04,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:31:04,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:31:04,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:31:04,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:31:04,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (1/1) ... [2022-02-20 17:31:04,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:04,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:04,920 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:31:04,947 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:31:04,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:31:04,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:31:04,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:31:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:31:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:31:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:31:05,018 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:31:05,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:31:05,143 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:31:05,149 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:31:05,149 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:31:05,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:05 BoogieIcfgContainer [2022-02-20 17:31:05,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:31:05,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:31:05,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:31:05,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:31:05,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:31:04" (1/3) ... [2022-02-20 17:31:05,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9aa5a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:05, skipping insertion in model container [2022-02-20 17:31:05,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:04" (2/3) ... [2022-02-20 17:31:05,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9aa5a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:05, skipping insertion in model container [2022-02-20 17:31:05,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:05" (3/3) ... [2022-02-20 17:31:05,158 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound5.c [2022-02-20 17:31:05,162 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:31:05,163 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:31:05,217 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:31:05,224 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:31:05,228 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:31:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:31:05,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:05,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:05,280 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:05,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:31:05,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:05,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486043631] [2022-02-20 17:31:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:05,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31#true} is VALID [2022-02-20 17:31:05,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {31#true} is VALID [2022-02-20 17:31:05,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {32#false} is VALID [2022-02-20 17:31:05,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {32#false} is VALID [2022-02-20 17:31:05,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:31:05,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:31:05,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-02-20 17:31:05,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:31:05,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:31:05,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:31:05,481 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:31:05,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:05,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486043631] [2022-02-20 17:31:05,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486043631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:05,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:05,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:31:05,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789799889] [2022-02-20 17:31:05,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:05,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,512 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:31:05,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:31:05,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:31:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:05,537 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:05,627 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:31:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:31:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:31:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:31:05,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:31:05,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:05,758 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:31:05,758 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:31:05,762 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:31:05,767 INFO L933 BasicCegarLoop]: 38 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, 38 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:31:05,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:31:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:31:05,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:05,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:05,794 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:05,795 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:05,803 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:31:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:31:05,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:05,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:05,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:31:05,805 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:31:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:05,809 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:31:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:31:05,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:05,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:05,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:05,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:31:05,815 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:31:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:05,815 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:31:05,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:31:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:31:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:31:05,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:05,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:05,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:31:05,818 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:05,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:31:05,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:05,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344930013] [2022-02-20 17:31:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:05,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:05,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189#true} is VALID [2022-02-20 17:31:05,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {189#true} is VALID [2022-02-20 17:31:05,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume !(0 == assume_abort_if_not_~cond#1); {189#true} is VALID [2022-02-20 17:31:05,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {189#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:05,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:05,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:05,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:05,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:05,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-02-20 17:31:05,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-02-20 17:31:05,935 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:31:05,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:05,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344930013] [2022-02-20 17:31:05,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344930013] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:05,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:05,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:05,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253977381] [2022-02-20 17:31:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:05,939 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:31:05,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:05,940 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:31:05,952 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:31:05,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:05,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:05,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:05,955 INFO L87 Difference]: Start difference. First operand 24 states and 34 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:31:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,140 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:31:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:06,141 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:31:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:06,141 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:31:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:06,144 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:31:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:06,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:31:06,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,205 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:31:06,205 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:31:06,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:06,213 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:06,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:31:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:31:06,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:06,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,226 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,227 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,234 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:31:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:31:06,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:31:06,242 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:31:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,248 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:31:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:31:06,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:06,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:31:06,254 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:31:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:06,255 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:31:06,255 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:31:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:31:06,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:06,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:06,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:31:06,256 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:06,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:31:06,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:06,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459347072] [2022-02-20 17:31:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:06,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(= ~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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:06,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:06,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:06,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:31:06,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {361#false} is VALID [2022-02-20 17:31:06,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {361#false} is VALID [2022-02-20 17:31:06,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#false} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {361#false} is VALID [2022-02-20 17:31:06,297 INFO L272 TraceCheckUtils]: 8: Hoare triple {361#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {361#false} is VALID [2022-02-20 17:31:06,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-02-20 17:31:06,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-02-20 17:31:06,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 17:31:06,298 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:31:06,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:06,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459347072] [2022-02-20 17:31:06,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459347072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:06,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:06,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:31:06,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145402079] [2022-02-20 17:31:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:06,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:31:06,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:06,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:31:06,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:31:06,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:31:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:06,313 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:31:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,417 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:31:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:31:06,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:31:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:31:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:31:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:31:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:31:06,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:31:06,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,488 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:31:06,488 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:31:06,489 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:31:06,490 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:06,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:31:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:31:06,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:06,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,495 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,495 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,497 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:31:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:31:06,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:31:06,499 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:31:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,501 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:31:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:31:06,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:06,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:31:06,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:31:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:06,504 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:31:06,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:31:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:31:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:31:06,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:06,505 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:06,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:31:06,506 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:31:06,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:06,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637871357] [2022-02-20 17:31:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:31:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:31:06,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:31:06,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:31:06,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} #74#return; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:06,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {527#true} is VALID [2022-02-20 17:31:06,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {527#true} is VALID [2022-02-20 17:31:06,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond#1); {527#true} is VALID [2022-02-20 17:31:06,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:06,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:06,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:06,589 INFO L272 TraceCheckUtils]: 6: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {527#true} is VALID [2022-02-20 17:31:06,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:31:06,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:31:06,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:31:06,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {527#true} {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} #74#return; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:06,592 INFO L272 TraceCheckUtils]: 11: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:06,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:06,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:31:06,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:31:06,594 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:31:06,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:06,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637871357] [2022-02-20 17:31:06,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637871357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:06,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:06,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:06,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677269460] [2022-02-20 17:31:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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 15 [2022-02-20 17:31:06,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:06,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:31:06,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:06,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:06,610 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:31:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,771 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:31:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:06,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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 15 [2022-02-20 17:31:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:31:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:31:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:06,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:31:06,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,841 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:31:06,841 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:31:06,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:06,842 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:06,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:31:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:31:06,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:06,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,848 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,848 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,851 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:31:06,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:31:06,852 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:31:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,854 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:31:06,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:06,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:31:06,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:31:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:06,857 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:31:06,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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:31:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:31:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:31:06,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:06,858 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:06,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:31:06,858 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:31:06,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:06,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106608927] [2022-02-20 17:31:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:06,878 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:06,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895833197] [2022-02-20 17:31:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:06,888 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:31:06,913 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:31:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:07,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {730#true} is VALID [2022-02-20 17:31:07,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {730#true} is VALID [2022-02-20 17:31:07,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(0 == assume_abort_if_not_~cond#1); {730#true} is VALID [2022-02-20 17:31:07,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:07,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:07,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:07,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {730#true} is VALID [2022-02-20 17:31:07,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:31:07,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:31:07,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:31:07,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #74#return; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:07,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {730#true} is VALID [2022-02-20 17:31:07,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:31:07,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:31:07,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:31:07,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #76#return; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:07,160 INFO L272 TraceCheckUtils]: 16: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:07,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:07,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:31:07,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:31:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:31:07,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:07,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:07,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106608927] [2022-02-20 17:31:07,162 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:07,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895833197] [2022-02-20 17:31:07,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895833197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:07,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:07,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:07,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950036065] [2022-02-20 17:31:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:31:07,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:07,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:07,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:07,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:07,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:07,180 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:09,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:31:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,525 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-02-20 17:31:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:09,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:31:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 17:31:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 17:31:09,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-20 17:31:09,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:09,604 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:31:09,605 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:31:09,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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:31:09,606 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:09,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 17:31:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:31:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:31:09,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:09,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:09,619 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:09,620 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,623 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 17:31:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:31:09,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:09,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:09,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-02-20 17:31:09,626 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-02-20 17:31:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,628 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 17:31:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:31:09,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:09,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:09,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:09,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-02-20 17:31:09,633 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 20 [2022-02-20 17:31:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:09,633 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-02-20 17:31:09,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:31:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:31:09,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:09,635 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:09,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:09,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:09,859 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:31:09,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:09,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075054191] [2022-02-20 17:31:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:09,881 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:09,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845942222] [2022-02-20 17:31:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:09,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:09,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:09,889 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:31:09,890 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:31:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:09,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:09,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:10,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:10,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1035#(<= ~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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:10,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {1035#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:10,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {1035#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:10,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {1035#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #74#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,214 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #76#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,214 INFO L272 TraceCheckUtils]: 16: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,216 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #78#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:10,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1103#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:31:10,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {1103#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {1031#false} is VALID [2022-02-20 17:31:10,217 INFO L272 TraceCheckUtils]: 24: Hoare triple {1031#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1031#false} is VALID [2022-02-20 17:31:10,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {1031#false} ~cond := #in~cond; {1031#false} is VALID [2022-02-20 17:31:10,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {1031#false} assume 0 == ~cond; {1031#false} is VALID [2022-02-20 17:31:10,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2022-02-20 17:31:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:10,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:10,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:10,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075054191] [2022-02-20 17:31:10,219 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:10,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845942222] [2022-02-20 17:31:10,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845942222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:10,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:10,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:31:10,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429821983] [2022-02-20 17:31:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:31:10,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:10,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:10,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:10,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:10,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:10,246 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:10,446 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 17:31:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:31:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:31:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:31:10,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 17:31:10,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:10,506 INFO L225 Difference]: With dead ends: 68 [2022-02-20 17:31:10,506 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 17:31:10,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:10,507 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:10,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 17:31:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-02-20 17:31:10,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:10,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:10,527 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:10,527 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:10,530 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:31:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:31:10,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:10,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:10,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:31:10,532 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:31:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:10,536 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:31:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:31:10,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:10,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:10,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:10,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-02-20 17:31:10,540 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 28 [2022-02-20 17:31:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:10,542 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-02-20 17:31:10,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-02-20 17:31:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:31:10,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:10,543 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:10,574 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:31:10,755 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,SelfDestructingSolverStorable5 [2022-02-20 17:31:10,756 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-02-20 17:31:10,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:10,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242168820] [2022-02-20 17:31:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:10,770 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:10,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408265158] [2022-02-20 17:31:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:10,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:10,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:10,777 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:31:10,778 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:31:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:10,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:31:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:10,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:11,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {1415#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1415#true} is VALID [2022-02-20 17:31:11,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {1415#true} is VALID [2022-02-20 17:31:11,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume !(0 == assume_abort_if_not_~cond#1); {1415#true} is VALID [2022-02-20 17:31:11,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {1415#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1415#true} is VALID [2022-02-20 17:31:11,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:31:11,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:31:11,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:31:11,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1415#true} {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #74#return; {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1415#true} is VALID [2022-02-20 17:31:11,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:31:11,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:31:11,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:31:11,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1415#true} {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,578 INFO L272 TraceCheckUtils]: 16: Hoare triple {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1415#true} is VALID [2022-02-20 17:31:11,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:31:11,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:31:11,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:31:11,584 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1415#true} {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #78#return; {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,586 INFO L272 TraceCheckUtils]: 24: Hoare triple {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:11,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:11,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {1498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1416#false} is VALID [2022-02-20 17:31:11,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-02-20 17:31:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:11,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:11,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:11,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242168820] [2022-02-20 17:31:11,588 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:11,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408265158] [2022-02-20 17:31:11,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408265158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:11,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:11,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:31:11,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519418924] [2022-02-20 17:31:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:31:11,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:11,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:11,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:31:11,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:31:11,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:11,619 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,721 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2022-02-20 17:31:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:31:12,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-20 17:31:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-02-20 17:31:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-02-20 17:31:12,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-02-20 17:31:12,809 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:31:12,811 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:31:12,811 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:31:12,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:31:12,812 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:12,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 149 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:31:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:31:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-02-20 17:31:12,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:12,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:12,829 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:12,829 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,832 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 17:31:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-20 17:31:12,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:12,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:12,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:31:12,833 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:31:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,836 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 17:31:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-20 17:31:12,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:12,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:12,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:12,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-02-20 17:31:12,839 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 28 [2022-02-20 17:31:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:12,840 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-02-20 17:31:12,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-02-20 17:31:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:31:12,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:12,841 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:12,866 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:31:13,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:13,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:13,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1040101153, now seen corresponding path program 1 times [2022-02-20 17:31:13,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:13,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243965476] [2022-02-20 17:31:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:13,087 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:13,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466519094] [2022-02-20 17:31:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:13,089 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:31:13,115 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:31:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:13,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:13,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:13,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:13,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(<= ~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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:13,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1851#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:13,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {1851#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:13,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {1851#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #74#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #76#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,293 INFO L272 TraceCheckUtils]: 16: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,295 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #78#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {1864#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:13,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {1864#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1919#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:31:13,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {1919#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1847#false} is VALID [2022-02-20 17:31:13,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {1847#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:13,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#false} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:13,297 INFO L272 TraceCheckUtils]: 26: Hoare triple {1847#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1847#false} is VALID [2022-02-20 17:31:13,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {1847#false} ~cond := #in~cond; {1847#false} is VALID [2022-02-20 17:31:13,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {1847#false} assume 0 == ~cond; {1847#false} is VALID [2022-02-20 17:31:13,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 17:31:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:13,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:13,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 17:31:13,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {1847#false} assume 0 == ~cond; {1847#false} is VALID [2022-02-20 17:31:13,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {1847#false} ~cond := #in~cond; {1847#false} is VALID [2022-02-20 17:31:13,443 INFO L272 TraceCheckUtils]: 26: Hoare triple {1847#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1847#false} is VALID [2022-02-20 17:31:13,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#false} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:13,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {1847#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:13,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {1959#(< |ULTIMATE.start_main_#t~post6#1| 5)} assume !(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1847#false} is VALID [2022-02-20 17:31:13,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {1963#(< ~counter~0 5)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1959#(< |ULTIMATE.start_main_#t~post6#1| 5)} is VALID [2022-02-20 17:31:13,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {1963#(< ~counter~0 5)} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1963#(< ~counter~0 5)} is VALID [2022-02-20 17:31:13,445 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1846#true} {1963#(< ~counter~0 5)} #78#return; {1963#(< ~counter~0 5)} is VALID [2022-02-20 17:31:13,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:31:13,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:31:13,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:31:13,446 INFO L272 TraceCheckUtils]: 16: Hoare triple {1963#(< ~counter~0 5)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:31:13,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1846#true} {1963#(< ~counter~0 5)} #76#return; {1963#(< ~counter~0 5)} is VALID [2022-02-20 17:31:13,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:31:13,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:31:13,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:31:13,447 INFO L272 TraceCheckUtils]: 11: Hoare triple {1963#(< ~counter~0 5)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:31:13,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1846#true} {1963#(< ~counter~0 5)} #74#return; {1963#(< ~counter~0 5)} is VALID [2022-02-20 17:31:13,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:31:13,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:31:13,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:31:13,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {1963#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:31:13,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {1963#(< ~counter~0 5)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {1963#(< ~counter~0 5)} is VALID [2022-02-20 17:31:13,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {2018#(< ~counter~0 4)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1963#(< ~counter~0 5)} is VALID [2022-02-20 17:31:13,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {2018#(< ~counter~0 4)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2018#(< ~counter~0 4)} is VALID [2022-02-20 17:31:13,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(< ~counter~0 4)} assume !(0 == assume_abort_if_not_~cond#1); {2018#(< ~counter~0 4)} is VALID [2022-02-20 17:31:13,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(< ~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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {2018#(< ~counter~0 4)} is VALID [2022-02-20 17:31:13,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2018#(< ~counter~0 4)} is VALID [2022-02-20 17:31:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:13,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:13,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243965476] [2022-02-20 17:31:13,459 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:13,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466519094] [2022-02-20 17:31:13,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466519094] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:13,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:13,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:31:13,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653422725] [2022-02-20 17:31:13,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:31:13,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:13,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:13,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:13,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:31:13,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:31:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:31:13,505 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:14,067 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-02-20 17:31:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:31:14,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:31:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-02-20 17:31:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-02-20 17:31:14,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2022-02-20 17:31:14,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:14,197 INFO L225 Difference]: With dead ends: 152 [2022-02-20 17:31:14,197 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 17:31:14,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:31:14,198 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:14,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 202 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:31:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 17:31:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2022-02-20 17:31:14,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:14,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:14,245 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:14,246 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:14,250 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-02-20 17:31:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-02-20 17:31:14,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:14,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:14,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 138 states. [2022-02-20 17:31:14,252 INFO L87 Difference]: Start difference. First operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 138 states. [2022-02-20 17:31:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:14,257 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-02-20 17:31:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-02-20 17:31:14,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:14,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:14,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:14,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2022-02-20 17:31:14,263 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 30 [2022-02-20 17:31:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:14,263 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2022-02-20 17:31:14,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2022-02-20 17:31:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:31:14,264 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:14,264 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:14,287 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:31:14,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:14,487 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1884102282, now seen corresponding path program 1 times [2022-02-20 17:31:14,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:14,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708899610] [2022-02-20 17:31:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:14,500 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:14,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399284729] [2022-02-20 17:31:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:14,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:14,502 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:31:14,522 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:31:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:14,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:31:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:14,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:15,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {2697#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2697#true} is VALID [2022-02-20 17:31:15,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {2697#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {2705#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:31:15,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {2705#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {2709#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} is VALID [2022-02-20 17:31:15,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {2709#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:15,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:15,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:15,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:15,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:15,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:15,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:15,717 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2697#true} {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #74#return; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:15,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:15,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#true} ~cond := #in~cond; {2741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:15,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:15,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:15,728 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:15,728 INFO L272 TraceCheckUtils]: 16: Hoare triple {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:15,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:15,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:15,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:15,729 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2697#true} {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #78#return; {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:15,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:15,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:15,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:15,731 INFO L272 TraceCheckUtils]: 24: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:15,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:15,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:15,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:15,731 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2697#true} {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #74#return; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:15,732 INFO L272 TraceCheckUtils]: 29: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:15,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:15,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:15,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:15,732 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2697#true} {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #76#return; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:15,736 INFO L272 TraceCheckUtils]: 34: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:15,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:15,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {2815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2698#false} is VALID [2022-02-20 17:31:15,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {2698#false} assume !false; {2698#false} is VALID [2022-02-20 17:31:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:31:15,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:17,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {2698#false} assume !false; {2698#false} is VALID [2022-02-20 17:31:17,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {2815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2698#false} is VALID [2022-02-20 17:31:17,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:17,300 INFO L272 TraceCheckUtils]: 34: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:17,301 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2697#true} {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #76#return; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:17,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:17,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:17,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:17,301 INFO L272 TraceCheckUtils]: 29: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:17,302 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2697#true} {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #74#return; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:17,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:17,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:17,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:17,302 INFO L272 TraceCheckUtils]: 24: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:17,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:17,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:18,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:18,453 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2697#true} {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} #78#return; {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:18,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:18,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:18,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:18,454 INFO L272 TraceCheckUtils]: 16: Hoare triple {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:18,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} #76#return; {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:18,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:18,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:18,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#true} ~cond := #in~cond; {2900#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:18,457 INFO L272 TraceCheckUtils]: 11: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:18,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2697#true} {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} #74#return; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:18,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:18,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:18,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:18,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:18,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:18,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:18,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {2697#true} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:18,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2697#true} assume !(0 == assume_abort_if_not_~cond#1); {2697#true} is VALID [2022-02-20 17:31:18,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2697#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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {2697#true} is VALID [2022-02-20 17:31:18,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {2697#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2697#true} is VALID [2022-02-20 17:31:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:31:18,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:18,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708899610] [2022-02-20 17:31:18,463 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:18,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399284729] [2022-02-20 17:31:18,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399284729] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:18,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:18,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-02-20 17:31:18,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075544008] [2022-02-20 17:31:18,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2022-02-20 17:31:18,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:18,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:20,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:20,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:31:20,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:20,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:31:20,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:31:20,714 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:25,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:31:29,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:33,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:35,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:42,159 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-02-20 17:31:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:31:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2022-02-20 17:31:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 17:31:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 17:31:42,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-02-20 17:31:46,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:46,036 INFO L225 Difference]: With dead ends: 166 [2022-02-20 17:31:46,036 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 17:31:46,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:31:46,037 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 86 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 84 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:46,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 213 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 239 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2022-02-20 17:31:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 17:31:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2022-02-20 17:31:46,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:46,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:46,104 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:46,105 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:46,117 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-02-20 17:31:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-02-20 17:31:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:46,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:46,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 158 states. [2022-02-20 17:31:46,120 INFO L87 Difference]: Start difference. First operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 158 states. [2022-02-20 17:31:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:46,126 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-02-20 17:31:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-02-20 17:31:46,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:46,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:46,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:46,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-02-20 17:31:46,131 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 38 [2022-02-20 17:31:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:46,131 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-02-20 17:31:46,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-02-20 17:31:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 17:31:46,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:46,135 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:46,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:46,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:46,346 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1109899640, now seen corresponding path program 1 times [2022-02-20 17:31:46,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:46,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781574901] [2022-02-20 17:31:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:46,358 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:46,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171478355] [2022-02-20 17:31:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:46,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:46,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:46,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:46,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:31:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:46,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:46,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:46,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:46,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {3706#(<= ~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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:46,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {3706#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:46,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {3706#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:46,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {3706#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {3719#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #74#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,702 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #76#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,702 INFO L272 TraceCheckUtils]: 16: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,704 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #78#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {3719#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:46,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {3719#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3774#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,706 INFO L272 TraceCheckUtils]: 24: Hoare triple {3774#(<= ~counter~0 2)} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3774#(<= ~counter~0 2)} ~cond := #in~cond; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == ~cond); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {3774#(<= ~counter~0 2)} assume true; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,708 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3774#(<= ~counter~0 2)} {3774#(<= ~counter~0 2)} #80#return; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,709 INFO L272 TraceCheckUtils]: 29: Hoare triple {3774#(<= ~counter~0 2)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {3774#(<= ~counter~0 2)} ~cond := #in~cond; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == ~cond); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {3774#(<= ~counter~0 2)} assume true; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,711 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3774#(<= ~counter~0 2)} {3774#(<= ~counter~0 2)} #82#return; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {3774#(<= ~counter~0 2)} assume !!(1 != main_~p~0#1 % 4294967296);main_~d~0#1 := (if main_~d~0#1 % 4294967296 < 0 && 0 != main_~d~0#1 % 4294967296 % 2 then 1 + main_~d~0#1 % 4294967296 / 2 else main_~d~0#1 % 4294967296 / 2);main_~p~0#1 := (if main_~p~0#1 % 4294967296 < 0 && 0 != main_~p~0#1 % 4294967296 % 2 then 1 + main_~p~0#1 % 4294967296 / 2 else main_~p~0#1 % 4294967296 / 2); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {3774#(<= ~counter~0 2)} assume main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {3774#(<= ~counter~0 2)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3817#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-20 17:31:46,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {3817#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {3702#false} is VALID [2022-02-20 17:31:46,718 INFO L272 TraceCheckUtils]: 38: Hoare triple {3702#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3702#false} is VALID [2022-02-20 17:31:46,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2022-02-20 17:31:46,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2022-02-20 17:31:46,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 17:31:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:31:46,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:46,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 17:31:46,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2022-02-20 17:31:46,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2022-02-20 17:31:46,935 INFO L272 TraceCheckUtils]: 38: Hoare triple {3702#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3702#false} is VALID [2022-02-20 17:31:46,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {3845#(< |ULTIMATE.start_main_#t~post7#1| 5)} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {3702#false} is VALID [2022-02-20 17:31:46,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {3849#(< ~counter~0 5)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3845#(< |ULTIMATE.start_main_#t~post7#1| 5)} is VALID [2022-02-20 17:31:46,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {3849#(< ~counter~0 5)} assume main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {3849#(< ~counter~0 5)} is VALID [2022-02-20 17:31:46,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {3849#(< ~counter~0 5)} assume !!(1 != main_~p~0#1 % 4294967296);main_~d~0#1 := (if main_~d~0#1 % 4294967296 < 0 && 0 != main_~d~0#1 % 4294967296 % 2 then 1 + main_~d~0#1 % 4294967296 / 2 else main_~d~0#1 % 4294967296 / 2);main_~p~0#1 := (if main_~p~0#1 % 4294967296 < 0 && 0 != main_~p~0#1 % 4294967296 % 2 then 1 + main_~p~0#1 % 4294967296 / 2 else main_~p~0#1 % 4294967296 / 2); {3849#(< ~counter~0 5)} is VALID [2022-02-20 17:31:46,937 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3701#true} {3849#(< ~counter~0 5)} #82#return; {3849#(< ~counter~0 5)} is VALID [2022-02-20 17:31:46,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:46,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:46,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:46,937 INFO L272 TraceCheckUtils]: 29: Hoare triple {3849#(< ~counter~0 5)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:46,937 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3701#true} {3849#(< ~counter~0 5)} #80#return; {3849#(< ~counter~0 5)} is VALID [2022-02-20 17:31:46,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:46,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:46,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:46,938 INFO L272 TraceCheckUtils]: 24: Hoare triple {3849#(< ~counter~0 5)} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:46,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {3849#(< ~counter~0 5)} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {3849#(< ~counter~0 5)} is VALID [2022-02-20 17:31:46,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {3892#(< ~counter~0 4)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3849#(< ~counter~0 5)} is VALID [2022-02-20 17:31:46,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {3892#(< ~counter~0 4)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {3892#(< ~counter~0 4)} is VALID [2022-02-20 17:31:46,939 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3701#true} {3892#(< ~counter~0 4)} #78#return; {3892#(< ~counter~0 4)} is VALID [2022-02-20 17:31:46,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:46,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:46,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:46,940 INFO L272 TraceCheckUtils]: 16: Hoare triple {3892#(< ~counter~0 4)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:46,941 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3701#true} {3892#(< ~counter~0 4)} #76#return; {3892#(< ~counter~0 4)} is VALID [2022-02-20 17:31:46,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:46,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:46,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:46,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {3892#(< ~counter~0 4)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:46,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3701#true} {3892#(< ~counter~0 4)} #74#return; {3892#(< ~counter~0 4)} is VALID [2022-02-20 17:31:46,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:46,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:46,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:46,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {3892#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:46,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3892#(< ~counter~0 4)} assume !!(main_#t~post6#1 < 5);havoc main_#t~post6#1; {3892#(< ~counter~0 4)} is VALID [2022-02-20 17:31:46,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {3774#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3892#(< ~counter~0 4)} is VALID [2022-02-20 17:31:46,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {3774#(<= ~counter~0 2)} assume { :end_inline_assume_abort_if_not } true;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == assume_abort_if_not_~cond#1); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {3774#(<= ~counter~0 2)} 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_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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 % 4294967296 >= 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; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:31:46,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:46,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781574901] [2022-02-20 17:31:46,946 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:46,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171478355] [2022-02-20 17:31:46,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171478355] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:46,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:46,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2022-02-20 17:31:46,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298263524] [2022-02-20 17:31:46,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:46,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2022-02-20 17:31:46,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:46,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:46,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:46,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:31:46,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:46,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:31:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:31:46,999 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,684 INFO L93 Difference]: Finished difference Result 227 states and 277 transitions. [2022-02-20 17:31:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:31:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2022-02-20 17:31:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2022-02-20 17:31:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2022-02-20 17:31:48,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 139 transitions. [2022-02-20 17:31:48,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:48,828 INFO L225 Difference]: With dead ends: 227 [2022-02-20 17:31:48,828 INFO L226 Difference]: Without dead ends: 203 [2022-02-20 17:31:48,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:31:48,829 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:48,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 236 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:31:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-20 17:31:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2022-02-20 17:31:48,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:48,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 138 states have internal predecessors, (155), 44 states have call successors, (44), 23 states have call predecessors, (44), 23 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 17:31:48,912 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 138 states have internal predecessors, (155), 44 states have call successors, (44), 23 states have call predecessors, (44), 23 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 17:31:48,912 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 138 states have internal predecessors, (155), 44 states have call successors, (44), 23 states have call predecessors, (44), 23 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 17:31:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,918 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2022-02-20 17:31:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2022-02-20 17:31:48,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:48,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:48,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 138 states have internal predecessors, (155), 44 states have call successors, (44), 23 states have call predecessors, (44), 23 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) Second operand 203 states. [2022-02-20 17:31:48,920 INFO L87 Difference]: Start difference. First operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 138 states have internal predecessors, (155), 44 states have call successors, (44), 23 states have call predecessors, (44), 23 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) Second operand 203 states. [2022-02-20 17:31:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,925 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2022-02-20 17:31:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2022-02-20 17:31:48,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:48,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:48,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:48,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 138 states have internal predecessors, (155), 44 states have call successors, (44), 23 states have call predecessors, (44), 23 states have return successors, (41), 36 states have call predecessors, (41), 41 states have call successors, (41) [2022-02-20 17:31:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2022-02-20 17:31:48,932 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 42 [2022-02-20 17:31:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:48,933 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2022-02-20 17:31:48,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2022-02-20 17:31:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 17:31:48,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:48,934 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:48,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 17:31:49,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:49,147 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1108171762, now seen corresponding path program 1 times [2022-02-20 17:31:49,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:49,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476783741] [2022-02-20 17:31:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:49,158 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:49,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476238594] [2022-02-20 17:31:49,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:49,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:49,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:49,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:49,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process