./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-industry-pattern/mod3.c.v+lhb-reducer.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/loop-industry-pattern/mod3.c.v+lhb-reducer.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 1ddd4991c5cc906892e1dead1f9e74e1cbe4e48f2d3e17b392b8efb86f500387 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:04:57,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:04:57,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:04:57,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:04:57,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:04:57,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:04:57,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:04:57,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:04:57,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:04:57,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:04:57,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:04:57,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:04:57,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:04:57,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:04:57,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:04:57,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:04:57,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:04:57,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:04:57,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:04:57,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:04:57,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:04:57,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:04:57,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:04:57,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:04:57,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:04:57,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:04:57,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:04:57,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:04:57,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:04:57,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:04:57,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:04:57,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:04:57,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:04:57,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:04:57,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:04:57,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:04:57,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:04:57,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:04:57,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:04:57,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:04:57,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:04:57,780 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:04:57,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:04:57,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:04:57,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:04:57,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:04:57,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:04:57,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:04:57,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:04:57,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:04:57,821 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:04:57,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:04:57,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:04:57,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:04:57,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:04:57,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:04:57,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:04:57,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:04:57,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:04:57,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:04:57,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:04:57,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:04:57,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:04:57,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:04:57,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:04:57,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:04:57,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:57,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:04:57,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:04:57,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:04:57,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:04:57,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:04:57,826 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:04:57,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:04:57,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:04:57,827 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 -> 1ddd4991c5cc906892e1dead1f9e74e1cbe4e48f2d3e17b392b8efb86f500387 [2022-02-20 17:04:58,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:04:58,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:04:58,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:04:58,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:04:58,050 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:04:58,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-02-20 17:04:58,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71f54952/34f67dbe9b6a468aa4d4f6f29e9bc6cd/FLAG8e2990d4d [2022-02-20 17:04:58,533 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:04:58,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-02-20 17:04:58,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71f54952/34f67dbe9b6a468aa4d4f6f29e9bc6cd/FLAG8e2990d4d [2022-02-20 17:04:58,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71f54952/34f67dbe9b6a468aa4d4f6f29e9bc6cd [2022-02-20 17:04:58,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:04:58,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:04:58,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:58,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:04:58,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:04:58,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466d2018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58, skipping insertion in model container [2022-02-20 17:04:58,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:04:58,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:04:58,762 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/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-02-20 17:04:58,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:58,777 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:04:58,794 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/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-02-20 17:04:58,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:58,809 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:04:58,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58 WrapperNode [2022-02-20 17:04:58,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:58,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:58,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:04:58,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:04:58,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:04:58" (1/1) ... [2022-02-20 17:04:58,822 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:04:58" (1/1) ... [2022-02-20 17:04:58,846 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2022-02-20 17:04:58,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:58,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:04:58,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:04:58,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:04:58,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:04:58,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:04:58,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:04:58,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:04:58,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (1/1) ... [2022-02-20 17:04:58,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:58,893 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:04:58,900 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:04:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:04:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:04:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:04:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:04:58,972 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:04:58,973 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:05:07,829 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:05:07,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:05:07,834 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 17:05:07,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:05:07 BoogieIcfgContainer [2022-02-20 17:05:07,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:05:07,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:05:07,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:05:07,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:05:07,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:04:58" (1/3) ... [2022-02-20 17:05:07,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f274d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:05:07, skipping insertion in model container [2022-02-20 17:05:07,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:58" (2/3) ... [2022-02-20 17:05:07,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f274d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:05:07, skipping insertion in model container [2022-02-20 17:05:07,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:05:07" (3/3) ... [2022-02-20 17:05:07,843 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.c [2022-02-20 17:05:07,848 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:05:07,848 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:05:07,894 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:05:07,902 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:05:07,902 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:05:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:05:07,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:05:07,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:05:07,933 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:05:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:05:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1053789450, now seen corresponding path program 1 times [2022-02-20 17:05:07,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:05:07,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293480519] [2022-02-20 17:05:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:05:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:05:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:05:08,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {26#true} is VALID [2022-02-20 17:05:08,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#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~nondet6#1, main_#t~nondet7#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_0~1#1, main_#t~nondet8#1, main_~main____CPAchecker_TMP_1~1#1, main_~main__x~0#1, main_~main__y~0#1, main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~main__y~0#1 := 1; {26#true} is VALID [2022-02-20 17:05:08,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26#true} is VALID [2022-02-20 17:05:08,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1); {26#true} is VALID [2022-02-20 17:05:10,581 WARN L290 TraceCheckUtils]: 4: Hoare triple {26#true} assume 1 == (if main_~main__x~0#1 % 4294967296 < 0 && 0 != main_~main__x~0#1 % 4294967296 % 3 then main_~main__x~0#1 % 4294967296 % 3 - 3 else main_~main__x~0#1 % 4294967296 % 3) % 4294967296;main_~main__x~0#1 := 2 + main_~main__x~0#1;main_~main__y~0#1 := 0;~__tmp_112_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is UNKNOWN [2022-02-20 17:05:10,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_112_0~0;~__tmp_94_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is VALID [2022-02-20 17:05:10,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_94_0~0;havoc main_~main____CPAchecker_TMP_0~1#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~1#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is VALID [2022-02-20 17:05:10,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} assume !!(0 == main_~main____CPAchecker_TMP_0~1#1); {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is VALID [2022-02-20 17:05:10,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} assume 0 == main_~main__y~0#1 % 4294967296;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == (if main_~main__x~0#1 % 4294967296 < 0 && 0 != main_~main__x~0#1 % 4294967296 % 3 then main_~main__x~0#1 % 4294967296 % 3 - 3 else main_~main__x~0#1 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {29#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:05:10,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {27#false} is VALID [2022-02-20 17:05:10,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 17:05:10,606 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:05:10,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:05:10,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293480519] [2022-02-20 17:05:10,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293480519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:05:10,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:05:10,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:05:10,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580478166] [2022-02-20 17:05:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:05:10,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:05:10,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:05:10,616 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), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:12,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:05:12,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:05:12,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:05:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:05:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:05:12,835 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:23,526 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:05:25,693 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:05:32,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:05:34,529 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:05:36,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:05:43,216 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:05:45,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:05:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:05:45,591 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-02-20 17:05:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:05:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:05:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:05:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-02-20 17:05:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-02-20 17:05:45,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-02-20 17:05:47,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:05:47,875 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:05:47,875 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:05:47,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:05:47,879 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:05:47,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 14.9s Time] [2022-02-20 17:05:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:05:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-20 17:05:47,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:05:47,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:47,908 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:47,908 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:05:47,910 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-20 17:05:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 17:05:47,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:05:47,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:05:47,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 17:05:47,912 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 17:05:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:05:47,914 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-20 17:05:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 17:05:47,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:05:47,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:05:47,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:05:47,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:05:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 17:05:47,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 11 [2022-02-20 17:05:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:05:47,918 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 17:05:47,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 17:05:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:05:47,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:05:47,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:05:47,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:05:47,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:05:47,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:05:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1942403648, now seen corresponding path program 1 times [2022-02-20 17:05:47,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:05:47,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916662406] [2022-02-20 17:05:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:05:47,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:05:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:05:48,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {199#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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {199#true} is VALID [2022-02-20 17:05:48,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#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~nondet6#1, main_#t~nondet7#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_0~1#1, main_#t~nondet8#1, main_~main____CPAchecker_TMP_1~1#1, main_~main__x~0#1, main_~main__y~0#1, main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~main__y~0#1 := 1; {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} is VALID [2022-02-20 17:05:48,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} is VALID [2022-02-20 17:05:48,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} assume !(0 == main_~main____CPAchecker_TMP_0~0#1); {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} is VALID [2022-02-20 17:05:48,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} assume !(1 == (if main_~main__x~0#1 % 4294967296 < 0 && 0 != main_~main__x~0#1 % 4294967296 % 3 then main_~main__x~0#1 % 4294967296 % 3 - 3 else main_~main__x~0#1 % 4294967296 % 3) % 4294967296); {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} is VALID [2022-02-20 17:05:50,474 WARN L290 TraceCheckUtils]: 5: Hoare triple {201#(and (<= |ULTIMATE.start_main_~main__x~0#1| 2147483647) (or (<= 0 (+ |ULTIMATE.start_main_~main__x~0#1| 2147483648)) (< 2863311527 (+ (* 2863311531 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296)) (* 2 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (div |ULTIMATE.start_main_~main__x~0#1| 4294967296)))))} assume 2 == (if main_~main__x~0#1 % 4294967296 < 0 && 0 != main_~main__x~0#1 % 4294967296 % 3 then main_~main__x~0#1 % 4294967296 % 3 - 3 else main_~main__x~0#1 % 4294967296 % 3) % 4294967296;main_~main__x~0#1 := 1 + main_~main__x~0#1;main_~main__y~0#1 := 0;~__tmp_93_0~0 := main_~main____CPAchecker_TMP_0~0#1; {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is UNKNOWN [2022-02-20 17:05:50,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_93_0~0;~__tmp_94_0~0 := main_~main____CPAchecker_TMP_0~1#1; {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is VALID [2022-02-20 17:05:50,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_94_0~0;havoc main_~main____CPAchecker_TMP_0~1#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main____CPAchecker_TMP_0~1#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is VALID [2022-02-20 17:05:50,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} assume !!(0 == main_~main____CPAchecker_TMP_0~1#1); {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} is VALID [2022-02-20 17:05:50,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#(<= |ULTIMATE.start_main_~main__x~0#1| (+ (* 3 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) 4294967296) (* 4294967296 (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div |ULTIMATE.start_main_~main__x~0#1| 4294967296) (- 4294967296)) |ULTIMATE.start_main_~main__x~0#1|) 3)) |ULTIMATE.start_main_~main__x~0#1|) 4294967296))))} assume 0 == main_~main__y~0#1 % 4294967296;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == (if main_~main__x~0#1 % 4294967296 < 0 && 0 != main_~main__x~0#1 % 4294967296 % 3 then main_~main__x~0#1 % 4294967296 % 3 - 3 else main_~main__x~0#1 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {203#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:05:50,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {203#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {200#false} is VALID [2022-02-20 17:05:50,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {200#false} assume !false; {200#false} is VALID [2022-02-20 17:05:50,484 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:05:50,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:05:50,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916662406] [2022-02-20 17:05:50,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916662406] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:05:50,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:05:50,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:05:50,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531064635] [2022-02-20 17:05:50,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:05:50,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:05:50,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:05:50,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:52,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 11 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:05:52,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:05:52,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:05:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:05:52,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:05:52,672 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:05:56,887 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:05:59,092 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:06:03,399 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:06:05,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:06:07,927 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:06:12,214 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:06:14,489 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:06:16,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []