./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.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/loops-crafted-1/mono-crafted_11.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 c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:07:24,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:07:24,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:07:24,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:07:24,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:07:24,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:07:24,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:07:24,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:07:24,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:07:24,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:07:24,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:07:24,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:07:24,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:07:24,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:07:24,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:07:24,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:07:24,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:07:24,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:07:24,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:07:24,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:07:24,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:07:24,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:07:24,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:07:24,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:07:24,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:07:24,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:07:24,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:07:24,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:07:24,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:07:24,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:07:24,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:07:24,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:07:24,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:07:24,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:07:24,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:07:24,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:07:24,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:07:24,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:07:24,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:07:24,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:07:24,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:07:24,889 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:07:24,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:07:24,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:07:24,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:07:24,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:07:24,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:07:24,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:07:24,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:07:24,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:07:24,918 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:07:24,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:07:24,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:07:24,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:07:24,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:07:24,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:07:24,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:07:24,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:07:24,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:07:24,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:07:24,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:07:24,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:07:24,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:07:24,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:07:24,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:07:24,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:07:24,923 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:07:24,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:07:24,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:07:24,923 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 -> c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 [2022-02-20 17:07:25,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:07:25,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:07:25,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:07:25,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:07:25,146 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:07:25,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2022-02-20 17:07:25,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12c26eac/513ad050e163483eb2cb017c5a1fbec9/FLAGb804dbc76 [2022-02-20 17:07:25,496 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:07:25,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2022-02-20 17:07:25,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12c26eac/513ad050e163483eb2cb017c5a1fbec9/FLAGb804dbc76 [2022-02-20 17:07:25,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12c26eac/513ad050e163483eb2cb017c5a1fbec9 [2022-02-20 17:07:25,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:07:25,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:07:25,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:07:25,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:07:25,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:07:25,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:07:25" (1/1) ... [2022-02-20 17:07:25,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d560520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:25, skipping insertion in model container [2022-02-20 17:07:25,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:07:25" (1/1) ... [2022-02-20 17:07:25,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:07:25,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:07:26,061 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/loops-crafted-1/mono-crafted_11.c[319,332] [2022-02-20 17:07:26,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:07:26,086 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:07:26,094 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/loops-crafted-1/mono-crafted_11.c[319,332] [2022-02-20 17:07:26,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:07:26,108 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:07:26,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26 WrapperNode [2022-02-20 17:07:26,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:07:26,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:07:26,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:07:26,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:07:26,126 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:07:26" (1/1) ... [2022-02-20 17:07:26,133 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:07:26" (1/1) ... [2022-02-20 17:07:26,161 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2022-02-20 17:07:26,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:07:26,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:07:26,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:07:26,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:07:26,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:07:26,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:07:26,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:07:26,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:07:26,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (1/1) ... [2022-02-20 17:07:26,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:07:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:26,192 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:07:26,194 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:07:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:07:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:07:26,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:07:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:07:26,271 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:07:26,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:07:26,400 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:07:26,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:07:26,404 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:07:26,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:07:26 BoogieIcfgContainer [2022-02-20 17:07:26,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:07:26,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:07:26,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:07:26,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:07:26,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:07:25" (1/3) ... [2022-02-20 17:07:26,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2618aff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:07:26, skipping insertion in model container [2022-02-20 17:07:26,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:26" (2/3) ... [2022-02-20 17:07:26,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2618aff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:07:26, skipping insertion in model container [2022-02-20 17:07:26,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:07:26" (3/3) ... [2022-02-20 17:07:26,411 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-02-20 17:07:26,414 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:07:26,420 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:07:26,480 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:07:26,485 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:07:26,485 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:07:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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:07:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:07:26,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:26,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:07:26,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2022-02-20 17:07:26,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:26,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95696614] [2022-02-20 17:07:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:26,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#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(18, 2);call #Ultimate.allocInit(12, 3); {15#true} is VALID [2022-02-20 17:07:26,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {15#true} is VALID [2022-02-20 17:07:26,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {15#true} assume !true; {16#false} is VALID [2022-02-20 17:07:26,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 17:07:26,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 17:07:26,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 17:07:26,633 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:07:26,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:26,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95696614] [2022-02-20 17:07:26,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95696614] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:07:26,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:07:26,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:07:26,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676800962] [2022-02-20 17:07:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:07:26,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-20 17:07:26,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:26,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:26,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:26,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:07:26,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:07:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:07:26,684 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:26,705 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:07:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:07:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-20 17:07:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-02-20 17:07:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-02-20 17:07:26,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2022-02-20 17:07:26,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:26,750 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:07:26,750 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:07:26,754 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:07:26,757 INFO L933 BasicCegarLoop]: 13 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, 13 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:07:26,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:07:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:07:26,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:26,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:07:26,776 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:07:26,776 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:07:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:26,778 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-20 17:07:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-20 17:07:26,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:26,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:26,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 8 states. [2022-02-20 17:07:26,780 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 8 states. [2022-02-20 17:07:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:26,781 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-20 17:07:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-20 17:07:26,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:26,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:26,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:26,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:07:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-02-20 17:07:26,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-02-20 17:07:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:26,787 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-20 17:07:26,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-02-20 17:07:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:07:26,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:26,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:07:26,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:07:26,789 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2022-02-20 17:07:26,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:26,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515566927] [2022-02-20 17:07:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:26,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#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(18, 2);call #Ultimate.allocInit(12, 3); {67#true} is VALID [2022-02-20 17:07:26,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {69#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:26,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {69#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 < 100000000); {68#false} is VALID [2022-02-20 17:07:26,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {68#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {68#false} is VALID [2022-02-20 17:07:26,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#false} assume 0 == __VERIFIER_assert_~cond#1; {68#false} is VALID [2022-02-20 17:07:26,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 17:07:26,910 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:07:26,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:26,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515566927] [2022-02-20 17:07:26,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515566927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:07:26,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:07:26,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:07:26,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798267250] [2022-02-20 17:07:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:07:26,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 17:07:26,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:26,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:07:26,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:26,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:07:26,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:07:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:07:26,927 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:07:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:26,957 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-02-20 17:07:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:07:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 17:07:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:07:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-20 17:07:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:07:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-20 17:07:26,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2022-02-20 17:07:26,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:26,983 INFO L225 Difference]: With dead ends: 16 [2022-02-20 17:07:26,983 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:07:26,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:07:26,984 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:26,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:07:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 17:07:26,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:26,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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:07:26,987 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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:07:26,987 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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:07:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:26,988 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-20 17:07:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-20 17:07:26,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:26,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:26,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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) Second operand 10 states. [2022-02-20 17:07:26,989 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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) Second operand 10 states. [2022-02-20 17:07:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:26,989 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-20 17:07:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-20 17:07:26,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:26,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:26,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:26,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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:07:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-02-20 17:07:26,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-02-20 17:07:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:26,991 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-20 17:07:26,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:07:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-20 17:07:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:07:26,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:26,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:26,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:07:26,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2022-02-20 17:07:26,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:26,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200483007] [2022-02-20 17:07:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:27,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(18, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-20 17:07:27,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {125#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {125#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {125#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {126#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:07:27,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 1))} assume !(main_~x~0#1 % 4294967296 < 100000000); {124#false} is VALID [2022-02-20 17:07:27,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {124#false} is VALID [2022-02-20 17:07:27,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond#1; {124#false} is VALID [2022-02-20 17:07:27,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:07:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:27,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:27,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200483007] [2022-02-20 17:07:27,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200483007] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:27,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704216778] [2022-02-20 17:07:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:27,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:27,052 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:07:27,053 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:07:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:27,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:07:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:27,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:27,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(18, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-20 17:07:27,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {125#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {125#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {125#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {139#(= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-20 17:07:27,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#(= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 % 4294967296 < 100000000); {124#false} is VALID [2022-02-20 17:07:27,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {124#false} is VALID [2022-02-20 17:07:27,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond#1; {124#false} is VALID [2022-02-20 17:07:27,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:07:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:27,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:27,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:07:27,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond#1; {124#false} is VALID [2022-02-20 17:07:27,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {124#false} is VALID [2022-02-20 17:07:27,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {161#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000)} assume !(main_~x~0#1 % 4294967296 < 100000000); {124#false} is VALID [2022-02-20 17:07:27,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {165#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 100000000)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {161#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000)} is VALID [2022-02-20 17:07:27,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 100000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {165#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 100000000)} is VALID [2022-02-20 17:07:27,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {165#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 100000000)} is VALID [2022-02-20 17:07:27,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(18, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-20 17:07:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:27,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704216778] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:27,168 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:27,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 17:07:27,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448137021] [2022-02-20 17:07:27,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 8 [2022-02-20 17:07:27,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:27,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:07:27,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:27,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:07:27,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:07:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:07:27,181 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:07:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:27,259 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-20 17:07:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:07:27,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 8 [2022-02-20 17:07:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:07:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-02-20 17:07:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:07:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-02-20 17:07:27,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-02-20 17:07:27,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:27,282 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:07:27,282 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:07:27,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:07:27,283 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:27,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:07:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-20 17:07:27,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:27,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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:07:27,287 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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:07:27,287 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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:07:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:27,288 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 17:07:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:07:27,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:27,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:27,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 states. [2022-02-20 17:07:27,289 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 states. [2022-02-20 17:07:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:27,290 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-20 17:07:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:07:27,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:27,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:27,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:27,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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:07:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-20 17:07:27,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2022-02-20 17:07:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:27,291 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-20 17:07:27,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:07:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-20 17:07:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:07:27,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:27,292 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:27,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:07:27,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:27,510 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2022-02-20 17:07:27,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:27,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154343906] [2022-02-20 17:07:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:27,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#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(18, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 17:07:27,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {248#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {248#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:27,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:27,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {250#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:27,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {250#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {250#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:27,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {247#false} is VALID [2022-02-20 17:07:27,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#false} assume !(main_~x~0#1 % 4294967296 < 100000000); {247#false} is VALID [2022-02-20 17:07:27,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {247#false} is VALID [2022-02-20 17:07:27,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#false} assume 0 == __VERIFIER_assert_~cond#1; {247#false} is VALID [2022-02-20 17:07:27,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 17:07:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:27,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:27,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154343906] [2022-02-20 17:07:27,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154343906] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:27,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211014449] [2022-02-20 17:07:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:27,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:27,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:27,628 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:07:27,651 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:07:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:27,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:07:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:27,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:27,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#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(18, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 17:07:27,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {248#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {248#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:27,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:27,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:27,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {269#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:27,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {269#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:27,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {276#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:27,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 < 100000000); {276#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:27,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {283#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:07:27,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {247#false} is VALID [2022-02-20 17:07:27,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 17:07:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:27,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:28,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 17:07:28,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {247#false} is VALID [2022-02-20 17:07:28,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {283#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:07:28,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume !(main_~x~0#1 % 4294967296 < 100000000); {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:28,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:28,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:28,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#(= (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 2) 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:28,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {309#(= (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 2) 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {309#(= (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 2) 0)} is VALID [2022-02-20 17:07:28,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {309#(= (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 2) 0)} is VALID [2022-02-20 17:07:28,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:28,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {296#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:28,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#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(18, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 17:07:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:07:28,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211014449] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:28,055 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:28,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 10 [2022-02-20 17:07:28,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747018931] [2022-02-20 17:07:28,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:28,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:28,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:07:28,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:28,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:07:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:07:28,085 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:28,281 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-20 17:07:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:07:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-02-20 17:07:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-02-20 17:07:28,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-02-20 17:07:28,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:28,305 INFO L225 Difference]: With dead ends: 27 [2022-02-20 17:07:28,305 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:07:28,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:07:28,305 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:28,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:07:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:07:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-20 17:07:28,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:28,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,314 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,314 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:28,315 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 17:07:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 17:07:28,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:28,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:28,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 17:07:28,317 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 17:07:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:28,318 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 17:07:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 17:07:28,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:28,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:28,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:28,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-20 17:07:28,324 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-02-20 17:07:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:28,325 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-20 17:07:28,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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:07:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 17:07:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:07:28,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:28,335 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:28,351 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:07:28,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:07:28,552 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1176853889, now seen corresponding path program 2 times [2022-02-20 17:07:28,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:28,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600236450] [2022-02-20 17:07:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:28,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(18, 2);call #Ultimate.allocInit(12, 3); {421#true} is VALID [2022-02-20 17:07:28,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {423#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:28,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {423#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:28,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {423#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:28,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:28,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {426#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 3))} is VALID [2022-02-20 17:07:28,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 3))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {426#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 3))} is VALID [2022-02-20 17:07:28,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {426#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 3))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {422#false} is VALID [2022-02-20 17:07:28,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#false} assume !(main_~x~0#1 % 4294967296 < 100000000); {422#false} is VALID [2022-02-20 17:07:28,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-20 17:07:28,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0 == __VERIFIER_assert_~cond#1; {422#false} is VALID [2022-02-20 17:07:28,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-02-20 17:07:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:28,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:28,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600236450] [2022-02-20 17:07:28,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600236450] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:28,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085245120] [2022-02-20 17:07:28,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:07:28,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:28,660 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:07:28,661 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:07:28,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:07:28,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:07:28,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:07:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:28,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:28,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(18, 2);call #Ultimate.allocInit(12, 3); {421#true} is VALID [2022-02-20 17:07:28,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {423#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:28,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {423#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:28,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {423#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:28,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:28,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {451#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {451#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {451#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {458#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:28,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !(main_~x~0#1 % 4294967296 < 100000000); {422#false} is VALID [2022-02-20 17:07:28,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-20 17:07:28,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0 == __VERIFIER_assert_~cond#1; {422#false} is VALID [2022-02-20 17:07:28,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-02-20 17:07:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:28,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:28,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-02-20 17:07:28,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0 == __VERIFIER_assert_~cond#1; {422#false} is VALID [2022-02-20 17:07:28,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-20 17:07:28,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000)} assume !(main_~x~0#1 % 4294967296 < 100000000); {422#false} is VALID [2022-02-20 17:07:28,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {480#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {484#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#(< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {484#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {491#(< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {491#(< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {498#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {491#(< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {498#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {498#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {505#(< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {498#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {505#(< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {505#(< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)} is VALID [2022-02-20 17:07:28,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(18, 2);call #Ultimate.allocInit(12, 3); {421#true} is VALID [2022-02-20 17:07:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:28,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085245120] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:28,997 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:28,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-02-20 17:07:28,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683545218] [2022-02-20 17:07:28,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:28,998 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 17:07:28,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:28,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:29,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:07:29,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:07:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:07:29,024 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:29,326 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:07:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:07:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 17:07:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-02-20 17:07:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-02-20 17:07:29,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-02-20 17:07:29,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:29,371 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:07:29,371 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:07:29,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:07:29,372 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:29,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:07:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:07:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-02-20 17:07:29,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:29,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,393 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,393 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:29,394 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 17:07:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 17:07:29,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:29,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:29,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 17:07:29,395 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 17:07:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:29,396 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 17:07:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 17:07:29,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:29,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:29,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:29,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:07:29,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2022-02-20 17:07:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:29,398 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:07:29,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:07:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:07:29,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:29,412 INFO L514 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:29,433 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:07:29,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:29,615 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash -495138033, now seen corresponding path program 3 times [2022-02-20 17:07:29,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:29,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384613715] [2022-02-20 17:07:29,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:29,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:29,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#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(18, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-02-20 17:07:29,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {660#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {660#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {660#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {660#(= |ULTIMATE.start_main_~x~0#1| 0)} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {661#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {661#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {661#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {661#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {662#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {662#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {662#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {662#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {663#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {663#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {663#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {664#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {664#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {665#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {665#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {665#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {665#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {659#false} is VALID [2022-02-20 17:07:29,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#false} assume !!(main_~x~0#1 % 4294967296 < 100000000); {659#false} is VALID [2022-02-20 17:07:29,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {659#false} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {659#false} is VALID [2022-02-20 17:07:29,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#false} assume !!(main_~x~0#1 % 4294967296 < 100000000); {659#false} is VALID [2022-02-20 17:07:29,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {659#false} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {659#false} is VALID [2022-02-20 17:07:29,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {659#false} assume !(main_~x~0#1 % 4294967296 < 100000000); {659#false} is VALID [2022-02-20 17:07:29,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {659#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {659#false} is VALID [2022-02-20 17:07:29,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {659#false} assume 0 == __VERIFIER_assert_~cond#1; {659#false} is VALID [2022-02-20 17:07:29,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-02-20 17:07:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:07:29,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:29,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384613715] [2022-02-20 17:07:29,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384613715] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:29,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092574070] [2022-02-20 17:07:29,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:07:29,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:29,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:29,744 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:07:29,745 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:07:29,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-20 17:07:29,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:07:29,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:07:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:29,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#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(18, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {702#(< (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} is VALID [2022-02-20 17:07:30,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(< (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {702#(< (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} is VALID [2022-02-20 17:07:30,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#(< (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {709#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296) 10000000)} is VALID [2022-02-20 17:07:30,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296) 10000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {709#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296) 10000000)} is VALID [2022-02-20 17:07:30,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296) 10000000)} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {716#(< (mod (+ 4294967291 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} is VALID [2022-02-20 17:07:30,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(< (mod (+ 4294967291 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} assume !!(main_~x~0#1 % 4294967296 < 100000000); {716#(< (mod (+ 4294967291 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} is VALID [2022-02-20 17:07:30,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#(< (mod (+ 4294967291 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {723#(and (not (< (mod (+ 4294967294 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967289) 4294967296) 10000000))} is VALID [2022-02-20 17:07:30,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(and (not (< (mod (+ 4294967294 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967289) 4294967296) 10000000))} assume !(main_~x~0#1 % 4294967296 < 100000000); {659#false} is VALID [2022-02-20 17:07:30,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {659#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {659#false} is VALID [2022-02-20 17:07:30,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {659#false} assume 0 == __VERIFIER_assert_~cond#1; {659#false} is VALID [2022-02-20 17:07:30,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-02-20 17:07:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 17:07:30,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:30,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-02-20 17:07:30,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {739#(not (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {659#false} is VALID [2022-02-20 17:07:30,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {743#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == (if main_~x~0#1 % 4294967296 < 0 && 0 != main_~x~0#1 % 4294967296 % 2 then main_~x~0#1 % 4294967296 % 2 - 2 else main_~x~0#1 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {739#(not (<= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:07:30,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {747#(or (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))} assume !(main_~x~0#1 % 4294967296 < 100000000); {743#(= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)} is VALID [2022-02-20 17:07:30,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#(or (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {747#(or (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))} is VALID [2022-02-20 17:07:30,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {755#(or (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000) (not (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000)))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {751#(or (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000))} is VALID [2022-02-20 17:07:30,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {759#(or (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {755#(or (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000) (not (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 100000000)))} is VALID [2022-02-20 17:07:30,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {759#(or (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {759#(or (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000))} is VALID [2022-02-20 17:07:30,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)))} assume !(main_~x~0#1 % 4294967296 < 10000000);main_~x~0#1 := 2 + main_~x~0#1; {759#(or (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000)) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000))} is VALID [2022-02-20 17:07:30,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)))} assume !!(main_~x~0#1 % 4294967296 < 100000000); {766#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)))} is VALID [2022-02-20 17:07:30,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {766#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 100000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 100000000)))} is VALID [2022-02-20 17:07:30,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#true} assume main_~x~0#1 % 4294967296 < 10000000;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {658#true} is VALID [2022-02-20 17:07:30,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume !!(main_~x~0#1 % 4294967296 < 100000000); {658#true} is VALID [2022-02-20 17:07:30,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1;main_~x~0#1 := 0; {658#true} is VALID [2022-02-20 17:07:30,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#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(18, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-02-20 17:07:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 17:07:30,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092574070] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:30,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:30,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9] total 19 [2022-02-20 17:07:30,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642275863] [2022-02-20 17:07:30,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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 22 [2022-02-20 17:07:30,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:30,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:07:30,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:30,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 17:07:30,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 17:07:30,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:07:30,987 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:07:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:32,041 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-02-20 17:07:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:07:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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 22 [2022-02-20 17:07:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:07:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2022-02-20 17:07:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:07:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2022-02-20 17:07:32,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 48 transitions. [2022-02-20 17:07:32,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:32,182 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:07:32,182 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:07:32,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-02-20 17:07:32,186 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:32,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 11 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:07:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:07:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:07:32,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:32,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:32,204 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:32,204 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:32,205 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:07:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:07:32,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:32,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:32,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:07:32,205 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:07:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:32,205 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:07:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:07:32,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:32,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:32,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:32,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:07:32,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-02-20 17:07:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:32,206 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:07:32,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 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:07:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:07:32,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:32,208 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:07:32,229 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:07:32,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:32,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:07:32,603 INFO L858 garLoopResultBuilder]: For program point L4-3(line 4) no Hoare annotation was computed. [2022-02-20 17:07:32,603 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:07:32,603 INFO L861 garLoopResultBuilder]: At program point L17(lines 5 18) the Hoare annotation is: true [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point L9(lines 9 13) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L854 garLoopResultBuilder]: At program point L9-2(lines 8 14) the Hoare annotation is: (or (< (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296) 10000000) (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0)) [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point L8-2(lines 8 14) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point L4(line 4) no Hoare annotation was computed. [2022-02-20 17:07:32,604 INFO L858 garLoopResultBuilder]: For program point L4-1(line 4) no Hoare annotation was computed. [2022-02-20 17:07:32,606 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-20 17:07:32,607 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 17:07:32,609 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-02-20 17:07:32,610 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:07:32,610 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:07:32,610 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:07:32,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:07:32 BoogieIcfgContainer [2022-02-20 17:07:32,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:07:32,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:07:32,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:07:32,616 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:07:32,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:07:26" (3/4) ... [2022-02-20 17:07:32,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:07:32,623 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:07:32,623 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:07:32,623 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:07:32,623 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:07:32,645 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:07:32,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:07:32,646 INFO L158 Benchmark]: Toolchain (without parser) took 6714.79ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 72.1MB in the beginning and 95.9MB in the end (delta: -23.9MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2022-02-20 17:07:32,646 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:07:32,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.37ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 71.8MB in the beginning and 107.6MB in the end (delta: -35.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:07:32,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.16ms. Allocated memory is still 132.1MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:07:32,646 INFO L158 Benchmark]: Boogie Preprocessor took 11.02ms. Allocated memory is still 132.1MB. Free memory was 106.3MB in the beginning and 105.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:07:32,647 INFO L158 Benchmark]: RCFGBuilder took 232.39ms. Allocated memory is still 132.1MB. Free memory was 105.2MB in the beginning and 95.9MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:07:32,647 INFO L158 Benchmark]: TraceAbstraction took 6208.66ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 95.4MB in the beginning and 98.0MB in the end (delta: -2.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-02-20 17:07:32,647 INFO L158 Benchmark]: Witness Printer took 29.49ms. Allocated memory is still 159.4MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:07:32,648 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.37ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 71.8MB in the beginning and 107.6MB in the end (delta: -35.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.16ms. Allocated memory is still 132.1MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.02ms. Allocated memory is still 132.1MB. Free memory was 106.3MB in the beginning and 105.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.39ms. Allocated memory is still 132.1MB. Free memory was 105.2MB in the beginning and 95.9MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6208.66ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 95.4MB in the beginning and 98.0MB in the end (delta: -2.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 29.49ms. Allocated memory is still 159.4MB. Free memory was 98.0MB in the beginning and 95.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 38 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 22 NumberOfFragments, 14 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1214 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 199 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 124 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 723 SizeOfPredicates, 5 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 155/270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: (4294967295 + x) % 4294967296 < 10000000 || x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:07:32,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE