./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/count_up_down-1.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/count_up_down-1.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 5879e48447fc7f125bd26345b332bcb57cae00365c3de30b5785162154970826 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:58:27,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:58:27,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:58:27,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:58:27,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:58:27,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:58:27,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:58:27,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:58:27,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:58:27,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:58:27,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:58:27,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:58:27,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:58:27,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:58:27,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:58:27,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:58:27,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:58:27,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:58:27,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:58:27,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:58:27,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:58:27,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:58:27,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:58:27,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:58:27,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:58:27,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:58:27,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:58:27,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:58:27,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:58:27,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:58:27,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:58:27,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:58:27,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:58:27,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:58:27,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:58:27,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:58:27,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:58:27,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:58:27,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:58:27,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:58:27,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:58:27,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:58:27,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:58:27,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:58:27,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:58:27,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:58:27,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:58:27,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:58:27,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:58:27,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:58:27,140 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:58:27,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:58:27,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:58:27,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:58:27,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:58:27,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:58:27,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:58:27,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:58:27,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:58:27,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:58:27,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:58:27,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:58:27,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:58:27,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:58:27,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:58:27,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:58:27,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:58:27,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:58:27,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:58:27,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:58:27,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:58:27,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:58:27,145 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:58:27,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:58:27,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:58:27,145 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 -> 5879e48447fc7f125bd26345b332bcb57cae00365c3de30b5785162154970826 [2022-02-20 16:58:27,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:58:27,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:58:27,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:58:27,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:58:27,403 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:58:27,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/count_up_down-1.c [2022-02-20 16:58:27,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c437194/ff42fa58a2264f078563f3723bfd2fb3/FLAG64c46febc [2022-02-20 16:58:27,846 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:58:27,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/count_up_down-1.c [2022-02-20 16:58:27,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c437194/ff42fa58a2264f078563f3723bfd2fb3/FLAG64c46febc [2022-02-20 16:58:27,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c437194/ff42fa58a2264f078563f3723bfd2fb3 [2022-02-20 16:58:27,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:58:27,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:58:27,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:58:27,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:58:27,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:58:27,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:58:27" (1/1) ... [2022-02-20 16:58:27,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2c625f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:27, skipping insertion in model container [2022-02-20 16:58:27,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:58:27" (1/1) ... [2022-02-20 16:58:27,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:58:27,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:58:27,992 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/count_up_down-1.c[327,340] [2022-02-20 16:58:28,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:58:28,006 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:58:28,016 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/count_up_down-1.c[327,340] [2022-02-20 16:58:28,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:58:28,029 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:58:28,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28 WrapperNode [2022-02-20 16:58:28,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:58:28,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:58:28,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:58:28,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:58:28,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,055 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-02-20 16:58:28,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:58:28,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:58:28,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:58:28,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:58:28,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:58:28,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:58:28,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:58:28,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:58:28,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (1/1) ... [2022-02-20 16:58:28,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:58:28,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:28,112 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 16:58:28,136 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 16:58:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:58:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:58:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:58:28,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:58:28,199 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:58:28,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:58:28,356 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:58:28,361 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:58:28,361 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:58:28,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:58:28 BoogieIcfgContainer [2022-02-20 16:58:28,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:58:28,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:58:28,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:58:28,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:58:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:58:27" (1/3) ... [2022-02-20 16:58:28,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f035326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:58:28, skipping insertion in model container [2022-02-20 16:58:28,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:28" (2/3) ... [2022-02-20 16:58:28,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f035326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:58:28, skipping insertion in model container [2022-02-20 16:58:28,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:58:28" (3/3) ... [2022-02-20 16:58:28,369 INFO L111 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2022-02-20 16:58:28,373 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:58:28,376 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:58:28,420 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:58:28,428 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 16:58:28,429 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:58:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 16:58:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:58:28,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:28,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:58:28,446 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 16:58:28,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:28,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124717901] [2022-02-20 16:58:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:28,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#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); {14#true} is VALID [2022-02-20 16:58:28,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {16#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:28,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !(main_~x~0#1 % 4294967296 > 0); {17#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:58:28,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {17#(and (= |ULTIMATE.start_main_~y~0#1| 0) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:58:28,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {15#false} is VALID [2022-02-20 16:58:28,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 16:58:28,813 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 16:58:28,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:28,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124717901] [2022-02-20 16:58:28,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124717901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:58:28,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:58:28,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:58:28,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854432293] [2022-02-20 16:58:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:58:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:28,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:28,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:28,840 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 16:58:28,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:58:28,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:28,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:58:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:58:28,869 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:28,982 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 16:58:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:58:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 16:58:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 16:58:28,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-02-20 16:58:29,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:29,027 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:58:29,030 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 16:58:29,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:58:29,035 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:29,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:58:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 16:58:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 16:58:29,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:29,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 16:58:29,055 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 16:58:29,056 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 16:58:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:29,057 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 16:58:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:58:29,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:29,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:29,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 16:58:29,059 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 16:58:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:29,060 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 16:58:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:58:29,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:29,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:29,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:29,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 16:58:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 16:58:29,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 16:58:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:29,064 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 16:58:29,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 16:58:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:58:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:58:29,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:29,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:29,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:58:29,066 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:29,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-02-20 16:58:29,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:29,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781461339] [2022-02-20 16:58:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:29,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#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); {82#true} is VALID [2022-02-20 16:58:29,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {84#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:29,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {84#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {85#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:58:29,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !(main_~x~0#1 % 4294967296 > 0); {86#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-20 16:58:29,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {86#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:58:29,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {83#false} is VALID [2022-02-20 16:58:29,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 16:58:29,241 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 16:58:29,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:29,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781461339] [2022-02-20 16:58:29,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781461339] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:29,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040552272] [2022-02-20 16:58:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:29,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:29,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:29,247 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 16:58:29,252 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 16:58:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:29,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:58:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:29,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:29,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#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); {82#true} is VALID [2022-02-20 16:58:29,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {84#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:29,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {84#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {97#(and (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} is VALID [2022-02-20 16:58:29,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {97#(and (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} assume !(main_~x~0#1 % 4294967296 > 0); {101#(and (= |ULTIMATE.start_main_~y~0#1| 1) (<= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0))} is VALID [2022-02-20 16:58:29,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {101#(and (= |ULTIMATE.start_main_~y~0#1| 1) (<= (mod (+ 4294967295 |ULTIMATE.start_main_~n~0#1|) 4294967296) 0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {105#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:58:29,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {83#false} is VALID [2022-02-20 16:58:29,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 16:58:29,760 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 16:58:29,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:30,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#false} assume !false; {83#false} is VALID [2022-02-20 16:58:30,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {83#false} is VALID [2022-02-20 16:58:30,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {86#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {105#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:58:30,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(or (< 0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1))))} assume !(main_~x~0#1 % 4294967296 > 0); {86#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)))} is VALID [2022-02-20 16:58:30,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(or (and (< (+ |ULTIMATE.start_main_~n~0#1| (* 4294967296 (div (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) 2 |ULTIMATE.start_main_~y~0#1|)) (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| (* 4294967296 (div (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296))))) (< 0 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {121#(or (< 0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1))))} is VALID [2022-02-20 16:58:30,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {125#(or (and (< (+ |ULTIMATE.start_main_~n~0#1| (* 4294967296 (div (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) 2 |ULTIMATE.start_main_~y~0#1|)) (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1) (+ |ULTIMATE.start_main_~n~0#1| (* 4294967296 (div (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296))))) (< 0 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:30,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#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); {82#true} is VALID [2022-02-20 16:58:30,094 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 16:58:30,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040552272] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:30,097 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:30,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-20 16:58:30,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166395814] [2022-02-20 16:58:30,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) 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) Word has length 7 [2022-02-20 16:58:30,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:30,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) 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 16:58:30,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:30,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:58:30,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:58:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:58:30,129 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) 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 16:58:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:30,467 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-20 16:58:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:58:30,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) 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) Word has length 7 [2022-02-20 16:58:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) 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 16:58:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2022-02-20 16:58:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) 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 16:58:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2022-02-20 16:58:30,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 19 transitions. [2022-02-20 16:58:30,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:30,507 INFO L225 Difference]: With dead ends: 17 [2022-02-20 16:58:30,507 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:58:30,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-02-20 16:58:30,509 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:30,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:58:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:58:30,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:58:30,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:30,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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 16:58:30,520 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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 16:58:30,521 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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 16:58:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:30,522 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:58:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:58:30,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:30,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:30,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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 11 states. [2022-02-20 16:58:30,523 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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 11 states. [2022-02-20 16:58:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:30,524 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:58:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:58:30,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:30,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:30,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:30,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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 16:58:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:58:30,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-02-20 16:58:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:30,526 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:58:30,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) 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 16:58:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:58:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:58:30,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:30,527 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:30,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:30,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:30,752 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-02-20 16:58:30,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:30,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159183754] [2022-02-20 16:58:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:31,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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); {201#true} is VALID [2022-02-20 16:58:31,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {203#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:31,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {204#(and (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967294 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= |ULTIMATE.start_main_~y~0#1| 1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:58:31,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {204#(and (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967294 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= |ULTIMATE.start_main_~y~0#1| 1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {205#(and (<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967293)) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-20 16:58:31,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(and (<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967293)) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {206#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967292 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-20 16:58:31,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967292 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {207#(and (or (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296) 4294967296 (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (or (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1))))} is VALID [2022-02-20 16:58:31,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#(and (or (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296) 4294967296 (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (or (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1))))} assume !(main_~x~0#1 % 4294967296 > 0); {208#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 16:58:31,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {209#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:58:31,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 16:58:31,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 16:58:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:31,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:31,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159183754] [2022-02-20 16:58:31,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159183754] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:31,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278251261] [2022-02-20 16:58:31,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:58:31,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:31,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:31,312 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 16:58:31,317 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 16:58:31,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:58:31,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:31,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 16:58:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:31,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:31,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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); {201#true} is VALID [2022-02-20 16:58:31,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {203#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:31,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {219#(and (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 16:58:31,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#(and (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {223#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~n~0#1| (+ 2 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 16:58:31,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {223#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= |ULTIMATE.start_main_~n~0#1| (+ 2 |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {227#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} is VALID [2022-02-20 16:58:31,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {231#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 2) |ULTIMATE.start_main_~n~0#1|) (+ 2 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 16:58:31,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 2) |ULTIMATE.start_main_~n~0#1|) (+ 2 |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 % 4294967296 > 0); {235#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (not (< 0 (mod (+ 4294967292 |ULTIMATE.start_main_~n~0#1|) 4294967296))))} is VALID [2022-02-20 16:58:31,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (not (< 0 (mod (+ 4294967292 |ULTIMATE.start_main_~n~0#1|) 4294967296))))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {239#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:58:31,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 16:58:31,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 16:58:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:31,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:32,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 16:58:32,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 16:58:32,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {252#(= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {239#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:58:32,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(or (< 0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} assume !(main_~x~0#1 % 4294967296 > 0); {252#(= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))} is VALID [2022-02-20 16:58:32,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(or (< 0 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {256#(or (< 0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} is VALID [2022-02-20 16:58:32,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {264#(or (< 0 (mod (+ 4294967294 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 2 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {260#(or (< 0 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296)))} is VALID [2022-02-20 16:58:32,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#(or (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 3 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {264#(or (< 0 (mod (+ 4294967294 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 2 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:32,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {272#(or (< 0 (mod (+ 4294967292 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 4) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {268#(or (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 3 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:32,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {272#(or (< 0 (mod (+ 4294967292 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 4) 4294967296)))} is VALID [2022-02-20 16:58:32,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#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); {201#true} is VALID [2022-02-20 16:58:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:32,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278251261] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:32,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:32,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-02-20 16:58:32,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345311855] [2022-02-20 16:58:32,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 10 [2022-02-20 16:58:32,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:32,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 16:58:32,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:32,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 16:58:32,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:32,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 16:58:32,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-02-20 16:58:32,596 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 16:58:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:40,339 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:58:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 16:58:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 10 [2022-02-20 16:58:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 16:58:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2022-02-20 16:58:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 16:58:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2022-02-20 16:58:40,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 30 transitions. [2022-02-20 16:58:40,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:40,579 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:58:40,579 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:58:40,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 16:58:40,580 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:40,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 42 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:58:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:58:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 16:58:40,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:40,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 16:58:40,613 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 16:58:40,613 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 16:58:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:40,614 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:58:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:58:40,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:40,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:40,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2022-02-20 16:58:40,615 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2022-02-20 16:58:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:40,616 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:58:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:58:40,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:40,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:40,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:40,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 16:58:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-02-20 16:58:40,618 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-02-20 16:58:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:40,618 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-02-20 16:58:40,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 16:58:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:58:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:58:40,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:40,620 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:40,645 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 16:58:40,842 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,SelfDestructingSolverStorable2 [2022-02-20 16:58:40,843 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2022-02-20 16:58:40,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:40,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468246370] [2022-02-20 16:58:40,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:41,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {400#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); {400#true} is VALID [2022-02-20 16:58:41,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {402#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:41,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {403#(and (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967294 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= |ULTIMATE.start_main_~y~0#1| 1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:58:41,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {403#(and (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967294 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= |ULTIMATE.start_main_~y~0#1| 1) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {404#(and (<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967293)) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-20 16:58:41,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {404#(and (<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967293)) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {405#(and (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967292 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 3))} is VALID [2022-02-20 16:58:41,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#(and (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967292 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 3))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {406#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 4) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967291 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))))} is VALID [2022-02-20 16:58:41,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 4) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967291 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {407#(and (<= |ULTIMATE.start_main_~y~0#1| 5) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967290 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ 5 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:58:42,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#(and (<= |ULTIMATE.start_main_~y~0#1| 5) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967290 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ 5 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {408#(and (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967289)) (<= |ULTIMATE.start_main_~y~0#1| 6) (<= (+ 6 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:58:42,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {408#(and (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967289)) (<= |ULTIMATE.start_main_~y~0#1| 6) (<= (+ 6 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {409#(and (<= |ULTIMATE.start_main_~y~0#1| 7) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967288 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ 7 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:58:42,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(and (<= |ULTIMATE.start_main_~y~0#1| 7) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967288 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ 7 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {410#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 8) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967287)) (<= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 16:58:43,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 8) |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)) 4294967287)) (<= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {411#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (<= |ULTIMATE.start_main_~y~0#1| 9) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967286 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:58:43,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(and (<= (div |ULTIMATE.start_main_~x~0#1| 4294967296) (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (<= |ULTIMATE.start_main_~y~0#1| 9) (<= |ULTIMATE.start_main_~x~0#1| (+ 4294967286 (* 4294967296 (div (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|) (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) 4294967296)))) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {412#(and (or (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296) 4294967296 (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (or (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1))))} is VALID [2022-02-20 16:58:43,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#(and (or (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296) 4294967296 (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (or (<= (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~x~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1))))} assume !(main_~x~0#1 % 4294967296 > 0); {413#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 16:58:43,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {413#(and (<= (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296))) (< (+ |ULTIMATE.start_main_~n~0#1| (* (div |ULTIMATE.start_main_~y~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~y~0#1| 1)) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {414#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:58:43,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {414#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {401#false} is VALID [2022-02-20 16:58:43,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {401#false} assume !false; {401#false} is VALID [2022-02-20 16:58:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:43,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:43,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468246370] [2022-02-20 16:58:43,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468246370] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:43,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525938199] [2022-02-20 16:58:43,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:58:43,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:43,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:43,041 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 16:58:43,041 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 16:58:43,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 16:58:43,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:43,137 WARN L261 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 16:58:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:43,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:43,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {400#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); {400#true} is VALID [2022-02-20 16:58:43,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {402#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} is VALID [2022-02-20 16:58:43,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~n~0#1|)) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {424#(and (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 16:58:43,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {424#(and (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {428#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} is VALID [2022-02-20 16:58:43,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {428#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {432#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} is VALID [2022-02-20 16:58:43,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {436#(and (= (+ (- 3) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)) (= |ULTIMATE.start_main_~y~0#1| 4))} is VALID [2022-02-20 16:58:43,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {436#(and (= (+ (- 3) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)) (= |ULTIMATE.start_main_~y~0#1| 4))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {440#(and (= (+ (- 3) |ULTIMATE.start_main_~n~0#1|) (+ 2 |ULTIMATE.start_main_~x~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} is VALID [2022-02-20 16:58:43,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {440#(and (= (+ (- 3) |ULTIMATE.start_main_~n~0#1|) (+ 2 |ULTIMATE.start_main_~x~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {444#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) (+ |ULTIMATE.start_main_~x~0#1| 1)))} is VALID [2022-02-20 16:58:43,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) (+ |ULTIMATE.start_main_~x~0#1| 1)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {448#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ |ULTIMATE.start_main_~n~0#1| (- 6)) (+ |ULTIMATE.start_main_~x~0#1| 1)))} is VALID [2022-02-20 16:58:43,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {448#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ |ULTIMATE.start_main_~n~0#1| (- 6)) (+ |ULTIMATE.start_main_~x~0#1| 1)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {452#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 7) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} is VALID [2022-02-20 16:58:43,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 7) |ULTIMATE.start_main_~n~0#1|) (+ |ULTIMATE.start_main_~x~0#1| 1)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {456#(and (= (+ (- 7) |ULTIMATE.start_main_~n~0#1|) (+ 2 |ULTIMATE.start_main_~x~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:58:43,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#(and (= (+ (- 7) |ULTIMATE.start_main_~n~0#1|) (+ 2 |ULTIMATE.start_main_~x~0#1|)) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {460#(and (= (+ (- 7) |ULTIMATE.start_main_~n~0#1|) (+ 3 |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 16:58:43,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(and (= (+ (- 7) |ULTIMATE.start_main_~n~0#1|) (+ 3 |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !(main_~x~0#1 % 4294967296 > 0); {464#(and (not (< 0 (mod (+ 4294967286 |ULTIMATE.start_main_~n~0#1|) 4294967296))) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 16:58:43,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#(and (not (< 0 (mod (+ 4294967286 |ULTIMATE.start_main_~n~0#1|) 4294967296))) (= |ULTIMATE.start_main_~y~0#1| 10))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {468#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:58:43,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {401#false} is VALID [2022-02-20 16:58:43,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {401#false} assume !false; {401#false} is VALID [2022-02-20 16:58:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:43,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:45,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {401#false} assume !false; {401#false} is VALID [2022-02-20 16:58:45,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {401#false} is VALID [2022-02-20 16:58:45,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {481#(= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 % 4294967296 == main_~n~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {468#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:58:45,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {485#(or (< 0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} assume !(main_~x~0#1 % 4294967296 > 0); {481#(= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296))} is VALID [2022-02-20 16:58:45,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(or (< 0 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {485#(or (< 0 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~y~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} is VALID [2022-02-20 16:58:45,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(or (< 0 (mod (+ 4294967294 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 2 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {489#(or (< 0 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 1) 4294967296)))} is VALID [2022-02-20 16:58:45,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(or (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 3 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {493#(or (< 0 (mod (+ 4294967294 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 2 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:45,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#(or (< 0 (mod (+ 4294967292 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 4) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {497#(or (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967293) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 3 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:45,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 5 |ULTIMATE.start_main_~y~0#1|) 4294967296)) (< 0 (mod (+ 4294967291 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {501#(or (< 0 (mod (+ 4294967292 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 4) 4294967296)))} is VALID [2022-02-20 16:58:45,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 6 |ULTIMATE.start_main_~y~0#1|) 4294967296)) (< 0 (mod (+ 4294967290 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {505#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 5 |ULTIMATE.start_main_~y~0#1|) 4294967296)) (< 0 (mod (+ 4294967291 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:45,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 7 |ULTIMATE.start_main_~y~0#1|) 4294967296)) (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967289) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {509#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 6 |ULTIMATE.start_main_~y~0#1|) 4294967296)) (< 0 (mod (+ 4294967290 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:45,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#(or (< 0 (mod (+ 4294967288 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 8) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {513#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 7 |ULTIMATE.start_main_~y~0#1|) 4294967296)) (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967289) 4294967296)))} is VALID [2022-02-20 16:58:45,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {521#(or (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967287) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 9 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {517#(or (< 0 (mod (+ 4294967288 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 8) 4294967296)))} is VALID [2022-02-20 16:58:45,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 10) 4294967296)) (< 0 (mod (+ 4294967286 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 > 0);main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := main_#t~post5#1 - 1;havoc main_#t~post5#1;main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {521#(or (< 0 (mod (+ |ULTIMATE.start_main_~x~0#1| 4294967287) 4294967296)) (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ 9 |ULTIMATE.start_main_~y~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:45,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~n~0#1, main_~x~0#1, main_~y~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_~n~0#1;main_~y~0#1 := 0; {525#(or (= (mod |ULTIMATE.start_main_~n~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~y~0#1| 10) 4294967296)) (< 0 (mod (+ 4294967286 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 16:58:45,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {400#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); {400#true} is VALID [2022-02-20 16:58:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:45,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525938199] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:45,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:45,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-02-20 16:58:45,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123626200] [2022-02-20 16:58:45,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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 16 [2022-02-20 16:58:45,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:45,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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 16:58:46,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:46,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-20 16:58:46,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-20 16:58:46,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 16:58:46,060 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 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 16:58:50,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []