./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.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 e08e043468e5282f02e354e2c270afb93bc3c7e2c832eb66aa2f729b9359c6aa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:44:19,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:44:19,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:44:20,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:44:20,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:44:20,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:44:20,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:44:20,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:44:20,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:44:20,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:44:20,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:44:20,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:44:20,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:44:20,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:44:20,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:44:20,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:44:20,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:44:20,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:44:20,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:44:20,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:44:20,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:44:20,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:44:20,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:44:20,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:44:20,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:44:20,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:44:20,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:44:20,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:44:20,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:44:20,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:44:20,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:44:20,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:44:20,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:44:20,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:44:20,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:44:20,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:44:20,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:44:20,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:44:20,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:44:20,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:44:20,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:44:20,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:44:20,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:44:20,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:44:20,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:44:20,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:44:20,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:44:20,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:44:20,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:44:20,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:44:20,106 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:44:20,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:44:20,107 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:44:20,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:44:20,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:44:20,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:44:20,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:44:20,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:44:20,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:44:20,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:44:20,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:44:20,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:44:20,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:44:20,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:44:20,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:44:20,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:44:20,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:20,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:44:20,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:44:20,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:44:20,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:44:20,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:44:20,111 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:44:20,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:44:20,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:44:20,111 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 -> e08e043468e5282f02e354e2c270afb93bc3c7e2c832eb66aa2f729b9359c6aa [2022-02-20 19:44:20,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:44:20,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:44:20,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:44:20,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:44:20,341 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:44:20,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c [2022-02-20 19:44:20,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e87c305a/2b840d3eb55b4e3985d119d07ad57df6/FLAGd453c311e [2022-02-20 19:44:20,990 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:44:20,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c [2022-02-20 19:44:21,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e87c305a/2b840d3eb55b4e3985d119d07ad57df6/FLAGd453c311e [2022-02-20 19:44:21,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e87c305a/2b840d3eb55b4e3985d119d07ad57df6 [2022-02-20 19:44:21,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:44:21,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:44:21,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:21,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:44:21,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:44:21,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:21" (1/1) ... [2022-02-20 19:44:21,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756fe265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:21, skipping insertion in model container [2022-02-20 19:44:21,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:21" (1/1) ... [2022-02-20 19:44:21,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:44:21,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:44:21,919 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c[11640,11653] [2022-02-20 19:44:21,961 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c[18701,18714] [2022-02-20 19:44:22,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:22,616 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:44:22,654 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c[11640,11653] [2022-02-20 19:44:22,665 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/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c[18701,18714] [2022-02-20 19:44:23,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:23,129 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:44:23,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23 WrapperNode [2022-02-20 19:44:23,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:23,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:23,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:44:23,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:44:23,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:23,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:23,704 INFO L137 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5090 [2022-02-20 19:44:23,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:23,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:44:23,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:44:23,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:44:23,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:23,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:23,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:23,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:23,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:24,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:24,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:24,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:44:24,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:44:24,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:44:24,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:44:24,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (1/1) ... [2022-02-20 19:44:24,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:24,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:44:24,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:44:24,203 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 19:44:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:44:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:44:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:44:24,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:44:24,373 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:44:24,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:44:32,114 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:44:32,132 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:44:32,138 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:44:32,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:32 BoogieIcfgContainer [2022-02-20 19:44:32,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:44:32,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:44:32,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:44:32,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:44:32,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:44:21" (1/3) ... [2022-02-20 19:44:32,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3ced9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:32, skipping insertion in model container [2022-02-20 19:44:32,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:23" (2/3) ... [2022-02-20 19:44:32,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3ced9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:32, skipping insertion in model container [2022-02-20 19:44:32,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:32" (3/3) ... [2022-02-20 19:44:32,149 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label04.c [2022-02-20 19:44:32,156 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:44:32,157 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:44:32,213 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:44:32,221 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 19:44:32,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:44:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 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 19:44:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:32,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:32,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:32,272 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -441366565, now seen corresponding path program 1 times [2022-02-20 19:44:32,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:32,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041049027] [2022-02-20 19:44:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:32,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {912#true} is VALID [2022-02-20 19:44:32,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {912#true} is VALID [2022-02-20 19:44:32,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:44:32,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {912#true} is VALID [2022-02-20 19:44:32,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {912#true} init_#res#1 := init_~tmp~0#1; {912#true} is VALID [2022-02-20 19:44:32,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {912#true} is VALID [2022-02-20 19:44:32,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {913#false} is VALID [2022-02-20 19:44:32,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {913#false} is VALID [2022-02-20 19:44:32,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#false} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#false} assume !(node1_~m1~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:32,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~mode1~0 := 0; {913#false} is VALID [2022-02-20 19:44:32,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !(node2_~m2~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:32,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} ~mode2~0 := 0; {913#false} is VALID [2022-02-20 19:44:32,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !(node3_~m3~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:32,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#false} ~mode3~0 := 0; {913#false} is VALID [2022-02-20 19:44:32,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !(node4_~m4~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:32,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {913#false} ~mode4~0 := 0; {913#false} is VALID [2022-02-20 19:44:32,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {913#false} is VALID [2022-02-20 19:44:32,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {913#false} assume !(node5_~m5~0#1 != ~nomsg~0); {913#false} is VALID [2022-02-20 19:44:32,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} ~mode5~0 := 0; {913#false} is VALID [2022-02-20 19:44:32,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:44:32,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {913#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {913#false} is VALID [2022-02-20 19:44:32,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#false} check_#res#1 := check_~tmp~1#1; {913#false} is VALID [2022-02-20 19:44:32,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {913#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {913#false} is VALID [2022-02-20 19:44:32,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#false} assume 0 == assert_~arg#1 % 256; {913#false} is VALID [2022-02-20 19:44:32,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 19:44:32,511 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 19:44:32,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:32,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041049027] [2022-02-20 19:44:32,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041049027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:32,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:32,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:44:32,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425801932] [2022-02-20 19:44:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2022-02-20 19:44:32,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:32,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 19:44:32,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:32,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:44:32,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:44:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:44:32,587 INFO L87 Difference]: Start difference. First operand has 909 states, 906 states have (on average 1.900662251655629) internal successors, (1722), 908 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 19:44:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:34,106 INFO L93 Difference]: Finished difference Result 1781 states and 3374 transitions. [2022-02-20 19:44:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:44:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2022-02-20 19:44:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 19:44:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3374 transitions. [2022-02-20 19:44:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 19:44:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3374 transitions. [2022-02-20 19:44:34,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3374 transitions. [2022-02-20 19:44:36,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3374 edges. 3374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:36,960 INFO L225 Difference]: With dead ends: 1781 [2022-02-20 19:44:36,961 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:44:36,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:44:36,973 INFO L933 BasicCegarLoop]: 1656 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:36,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:44:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:44:37,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:37,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 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 19:44:37,073 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 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 19:44:37,074 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 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 19:44:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:37,116 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:44:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:37,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:37,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:37,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 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 843 states. [2022-02-20 19:44:37,133 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 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 843 states. [2022-02-20 19:44:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:37,172 INFO L93 Difference]: Finished difference Result 843 states and 1589 transitions. [2022-02-20 19:44:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:37,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:37,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:37,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:37,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8894173602853745) internal successors, (1589), 842 states have internal predecessors, (1589), 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 19:44:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1589 transitions. [2022-02-20 19:44:37,223 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1589 transitions. Word has length 34 [2022-02-20 19:44:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:37,224 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1589 transitions. [2022-02-20 19:44:37,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 19:44:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1589 transitions. [2022-02-20 19:44:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:44:37,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:37,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:37,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:44:37,226 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash -950839655, now seen corresponding path program 1 times [2022-02-20 19:44:37,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:37,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408301445] [2022-02-20 19:44:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:37,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {5271#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5271#true} is VALID [2022-02-20 19:44:37,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {5271#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {5271#true} is VALID [2022-02-20 19:44:37,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {5271#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5271#true} is VALID [2022-02-20 19:44:37,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {5271#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5273#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:44:37,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {5273#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5274#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:44:37,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {5274#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5275#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:44:37,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {5275#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5272#false} is VALID [2022-02-20 19:44:37,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {5272#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5272#false} is VALID [2022-02-20 19:44:37,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {5272#false} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {5272#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {5272#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:37,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {5272#false} ~mode1~0 := 0; {5272#false} is VALID [2022-02-20 19:44:37,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {5272#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {5272#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {5272#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:37,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#false} ~mode2~0 := 0; {5272#false} is VALID [2022-02-20 19:44:37,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {5272#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {5272#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {5272#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:37,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {5272#false} ~mode3~0 := 0; {5272#false} is VALID [2022-02-20 19:44:37,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {5272#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {5272#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:37,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {5272#false} ~mode4~0 := 0; {5272#false} is VALID [2022-02-20 19:44:37,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {5272#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {5272#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5272#false} is VALID [2022-02-20 19:44:37,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {5272#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5272#false} is VALID [2022-02-20 19:44:37,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {5272#false} ~mode5~0 := 0; {5272#false} is VALID [2022-02-20 19:44:37,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {5272#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5272#false} is VALID [2022-02-20 19:44:37,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {5272#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5272#false} is VALID [2022-02-20 19:44:37,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {5272#false} check_#res#1 := check_~tmp~1#1; {5272#false} is VALID [2022-02-20 19:44:37,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {5272#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5272#false} is VALID [2022-02-20 19:44:37,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {5272#false} assume 0 == assert_~arg#1 % 256; {5272#false} is VALID [2022-02-20 19:44:37,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {5272#false} assume !false; {5272#false} is VALID [2022-02-20 19:44:37,377 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 19:44:37,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:37,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408301445] [2022-02-20 19:44:37,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408301445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:37,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:37,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:44:37,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967550345] [2022-02-20 19:44:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-02-20 19:44:37,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:37,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 19:44:37,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:37,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:44:37,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:44:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:44:37,406 INFO L87 Difference]: Start difference. First operand 843 states and 1589 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 19:44:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:41,626 INFO L93 Difference]: Finished difference Result 899 states and 1675 transitions. [2022-02-20 19:44:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:44:41,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-02-20 19:44:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 19:44:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 19:44:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1675 transitions. [2022-02-20 19:44:41,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1675 transitions. [2022-02-20 19:44:43,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:43,038 INFO L225 Difference]: With dead ends: 899 [2022-02-20 19:44:43,039 INFO L226 Difference]: Without dead ends: 843 [2022-02-20 19:44:43,042 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 19:44:43,044 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 4727 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6314 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:44:43,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6314 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:44:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-20 19:44:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-02-20 19:44:43,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:44:43,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 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 19:44:43,071 INFO L74 IsIncluded]: Start isIncluded. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 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 19:44:43,074 INFO L87 Difference]: Start difference. First operand 843 states. Second operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 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 19:44:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:43,112 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:44:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:43,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:43,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:43,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 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 843 states. [2022-02-20 19:44:43,119 INFO L87 Difference]: Start difference. First operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 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 843 states. [2022-02-20 19:44:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:43,155 INFO L93 Difference]: Finished difference Result 843 states and 1558 transitions. [2022-02-20 19:44:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:43,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:44:43,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:44:43,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:44:43,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:44:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 841 states have (on average 1.8525564803804995) internal successors, (1558), 842 states have internal predecessors, (1558), 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 19:44:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1558 transitions. [2022-02-20 19:44:43,197 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1558 transitions. Word has length 34 [2022-02-20 19:44:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:44:43,198 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1558 transitions. [2022-02-20 19:44:43,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 19:44:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1558 transitions. [2022-02-20 19:44:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 19:44:43,202 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:43,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:43,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:44:43,203 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -80048283, now seen corresponding path program 1 times [2022-02-20 19:44:43,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:43,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870328327] [2022-02-20 19:44:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:43,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {8747#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet48#1);havoc main_#t~nondet48#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet46#1, main2_#t~ret47#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet46#1 && main2_#t~nondet46#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet46#1;havoc main2_#t~nondet46#1; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret43#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:44:43,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {8749#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8750#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:44:43,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {8750#(not (= (+ (- 3) ~a5~0) 0))} assume (((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8748#false} is VALID [2022-02-20 19:44:43,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {8748#false} assume !false; {8748#false} is VALID [2022-02-20 19:44:43,446 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 19:44:43,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:43,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870328327] [2022-02-20 19:44:43,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870328327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:43,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:43,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:44:43,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823987468] [2022-02-20 19:44:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:43,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-20 19:44:43,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:43,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 19:44:43,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:43,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:44:43,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:43,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:44:43,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:44:43,507 INFO L87 Difference]: Start difference. First operand 843 states and 1558 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 19:44:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:44:56,279 INFO L93 Difference]: Finished difference Result 3098 states and 5867 transitions. [2022-02-20 19:44:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:44:56,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-20 19:44:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:44:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 19:44:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5867 transitions. [2022-02-20 19:44:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 19:44:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5867 transitions. [2022-02-20 19:44:56,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5867 transitions. [2022-02-20 19:45:01,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5867 edges. 5867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:01,184 INFO L225 Difference]: With dead ends: 3098 [2022-02-20 19:45:01,184 INFO L226 Difference]: Without dead ends: 2345 [2022-02-20 19:45:01,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:45:01,188 INFO L933 BasicCegarLoop]: 794 mSDtfsCounter, 2421 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:01,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2421 Valid, 812 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-20 19:45:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-02-20 19:45:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2022-02-20 19:45:01,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:01,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5672215108834826) internal successors, (3672), 2344 states have internal predecessors, (3672), 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 19:45:01,249 INFO L74 IsIncluded]: Start isIncluded. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5672215108834826) internal successors, (3672), 2344 states have internal predecessors, (3672), 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 19:45:01,254 INFO L87 Difference]: Start difference. First operand 2345 states. Second operand has 2345 states, 2343 states have (on average 1.5672215108834826) internal successors, (3672), 2344 states have internal predecessors, (3672), 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 19:45:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:01,407 INFO L93 Difference]: Finished difference Result 2345 states and 3672 transitions. [2022-02-20 19:45:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3672 transitions. [2022-02-20 19:45:01,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:01,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:01,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 2345 states, 2343 states have (on average 1.5672215108834826) internal successors, (3672), 2344 states have internal predecessors, (3672), 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 2345 states. [2022-02-20 19:45:01,421 INFO L87 Difference]: Start difference. First operand has 2345 states, 2343 states have (on average 1.5672215108834826) internal successors, (3672), 2344 states have internal predecessors, (3672), 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 2345 states. [2022-02-20 19:45:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:01,610 INFO L93 Difference]: Finished difference Result 2345 states and 3672 transitions. [2022-02-20 19:45:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3672 transitions. [2022-02-20 19:45:01,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:01,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:01,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:01,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2343 states have (on average 1.5672215108834826) internal successors, (3672), 2344 states have internal predecessors, (3672), 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 19:45:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3672 transitions. [2022-02-20 19:45:01,784 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3672 transitions. Word has length 61 [2022-02-20 19:45:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:01,784 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 3672 transitions. [2022-02-20 19:45:01,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 19:45:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3672 transitions. [2022-02-20 19:45:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:01,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:01,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:01,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:45:01,786 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -695028240, now seen corresponding path program 1 times [2022-02-20 19:45:01,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:01,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237796902] [2022-02-20 19:45:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:01,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {18941#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {18941#true} is VALID [2022-02-20 19:45:01,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {18941#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {18941#true} is VALID [2022-02-20 19:45:01,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {18941#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {18941#true} is VALID [2022-02-20 19:45:01,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {18941#true} assume 0 == ~r1~0; {18941#true} is VALID [2022-02-20 19:45:01,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {18941#true} assume ~id1~0 >= 0; {18941#true} is VALID [2022-02-20 19:45:01,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {18941#true} assume 0 == ~st1~0; {18941#true} is VALID [2022-02-20 19:45:01,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {18941#true} assume ~send1~0 == ~id1~0; {18941#true} is VALID [2022-02-20 19:45:01,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {18941#true} assume 0 == ~mode1~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:45:01,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {18943#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {18942#false} assume !(node1_~m1~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:45:01,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {18942#false} ~mode1~0 := 0; {18942#false} is VALID [2022-02-20 19:45:01,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {18942#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {18942#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {18942#false} assume !(node2_~m2~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:45:01,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {18942#false} ~mode2~0 := 0; {18942#false} is VALID [2022-02-20 19:45:01,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {18942#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {18942#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {18942#false} assume !(node3_~m3~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:45:01,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {18942#false} ~mode3~0 := 0; {18942#false} is VALID [2022-02-20 19:45:01,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {18942#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {18942#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {18942#false} assume !(node4_~m4~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:45:01,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {18942#false} ~mode4~0 := 0; {18942#false} is VALID [2022-02-20 19:45:01,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {18942#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {18942#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18942#false} is VALID [2022-02-20 19:45:01,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {18942#false} assume !(node5_~m5~0#1 != ~nomsg~0); {18942#false} is VALID [2022-02-20 19:45:01,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {18942#false} ~mode5~0 := 0; {18942#false} is VALID [2022-02-20 19:45:01,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {18942#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {18942#false} is VALID [2022-02-20 19:45:01,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {18942#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {18942#false} is VALID [2022-02-20 19:45:01,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {18942#false} check_#res#1 := check_~tmp~1#1; {18942#false} is VALID [2022-02-20 19:45:01,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {18942#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {18942#false} is VALID [2022-02-20 19:45:01,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {18942#false} assume 0 == assert_~arg#1 % 256; {18942#false} is VALID [2022-02-20 19:45:01,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {18942#false} assume !false; {18942#false} is VALID [2022-02-20 19:45:01,899 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 19:45:01,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:01,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237796902] [2022-02-20 19:45:01,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237796902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:01,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:01,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:01,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721671033] [2022-02-20 19:45:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:01,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:01,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:01,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:01,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:01,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:01,947 INFO L87 Difference]: Start difference. First operand 2345 states and 3672 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:03,826 INFO L93 Difference]: Finished difference Result 2443 states and 3826 transitions. [2022-02-20 19:45:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:03,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:05,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:05,426 INFO L225 Difference]: With dead ends: 2443 [2022-02-20 19:45:05,426 INFO L226 Difference]: Without dead ends: 2391 [2022-02-20 19:45:05,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:05,428 INFO L933 BasicCegarLoop]: 1626 mSDtfsCounter, 1511 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:05,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1706 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2022-02-20 19:45:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2389. [2022-02-20 19:45:05,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:05,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5676581483033096) internal successors, (3742), 2388 states have internal predecessors, (3742), 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 19:45:05,494 INFO L74 IsIncluded]: Start isIncluded. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5676581483033096) internal successors, (3742), 2388 states have internal predecessors, (3742), 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 19:45:05,496 INFO L87 Difference]: Start difference. First operand 2391 states. Second operand has 2389 states, 2387 states have (on average 1.5676581483033096) internal successors, (3742), 2388 states have internal predecessors, (3742), 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 19:45:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:05,717 INFO L93 Difference]: Finished difference Result 2391 states and 3743 transitions. [2022-02-20 19:45:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3743 transitions. [2022-02-20 19:45:05,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:05,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:05,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 2389 states, 2387 states have (on average 1.5676581483033096) internal successors, (3742), 2388 states have internal predecessors, (3742), 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 2391 states. [2022-02-20 19:45:05,728 INFO L87 Difference]: Start difference. First operand has 2389 states, 2387 states have (on average 1.5676581483033096) internal successors, (3742), 2388 states have internal predecessors, (3742), 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 2391 states. [2022-02-20 19:45:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:05,898 INFO L93 Difference]: Finished difference Result 2391 states and 3743 transitions. [2022-02-20 19:45:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3743 transitions. [2022-02-20 19:45:05,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:05,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:05,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:05,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2387 states have (on average 1.5676581483033096) internal successors, (3742), 2388 states have internal predecessors, (3742), 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 19:45:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3742 transitions. [2022-02-20 19:45:06,091 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3742 transitions. Word has length 64 [2022-02-20 19:45:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:06,091 INFO L470 AbstractCegarLoop]: Abstraction has 2389 states and 3742 transitions. [2022-02-20 19:45:06,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3742 transitions. [2022-02-20 19:45:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:06,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:06,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:06,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:45:06,093 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1440610970, now seen corresponding path program 1 times [2022-02-20 19:45:06,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:06,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874110518] [2022-02-20 19:45:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:06,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {28632#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {28632#true} is VALID [2022-02-20 19:45:06,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {28632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {28632#true} is VALID [2022-02-20 19:45:06,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {28632#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28632#true} is VALID [2022-02-20 19:45:06,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {28632#true} assume 0 == ~r1~0; {28632#true} is VALID [2022-02-20 19:45:06,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {28632#true} assume ~id1~0 >= 0; {28632#true} is VALID [2022-02-20 19:45:06,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {28632#true} assume 0 == ~st1~0; {28632#true} is VALID [2022-02-20 19:45:06,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {28632#true} assume ~send1~0 == ~id1~0; {28632#true} is VALID [2022-02-20 19:45:06,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {28632#true} assume 0 == ~mode1~0 % 256; {28632#true} is VALID [2022-02-20 19:45:06,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {28632#true} assume ~id2~0 >= 0; {28632#true} is VALID [2022-02-20 19:45:06,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {28632#true} assume 0 == ~st2~0; {28632#true} is VALID [2022-02-20 19:45:06,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {28632#true} assume ~send2~0 == ~id2~0; {28632#true} is VALID [2022-02-20 19:45:06,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {28632#true} assume 0 == ~mode2~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:06,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {28634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {28633#false} assume !(node2_~m2~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:45:06,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {28633#false} ~mode2~0 := 0; {28633#false} is VALID [2022-02-20 19:45:06,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {28633#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {28633#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {28633#false} assume !(node3_~m3~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:45:06,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {28633#false} ~mode3~0 := 0; {28633#false} is VALID [2022-02-20 19:45:06,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {28633#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {28633#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {28633#false} assume !(node4_~m4~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:45:06,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {28633#false} ~mode4~0 := 0; {28633#false} is VALID [2022-02-20 19:45:06,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {28633#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {28633#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28633#false} is VALID [2022-02-20 19:45:06,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {28633#false} assume !(node5_~m5~0#1 != ~nomsg~0); {28633#false} is VALID [2022-02-20 19:45:06,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {28633#false} ~mode5~0 := 0; {28633#false} is VALID [2022-02-20 19:45:06,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {28633#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28633#false} is VALID [2022-02-20 19:45:06,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {28633#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {28633#false} is VALID [2022-02-20 19:45:06,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {28633#false} check_#res#1 := check_~tmp~1#1; {28633#false} is VALID [2022-02-20 19:45:06,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {28633#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {28633#false} is VALID [2022-02-20 19:45:06,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {28633#false} assume 0 == assert_~arg#1 % 256; {28633#false} is VALID [2022-02-20 19:45:06,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {28633#false} assume !false; {28633#false} is VALID [2022-02-20 19:45:06,169 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 19:45:06,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:06,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874110518] [2022-02-20 19:45:06,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874110518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:06,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:06,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:06,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065290043] [2022-02-20 19:45:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:06,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:06,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:06,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:06,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:06,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:06,212 INFO L87 Difference]: Start difference. First operand 2389 states and 3742 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:08,124 INFO L93 Difference]: Finished difference Result 2569 states and 4026 transitions. [2022-02-20 19:45:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:08,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:08,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:09,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:09,761 INFO L225 Difference]: With dead ends: 2569 [2022-02-20 19:45:09,761 INFO L226 Difference]: Without dead ends: 2473 [2022-02-20 19:45:09,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:09,763 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1507 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:09,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1705 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-02-20 19:45:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2471. [2022-02-20 19:45:09,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:09,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5678412312677197) internal successors, (3871), 2470 states have internal predecessors, (3871), 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 19:45:09,847 INFO L74 IsIncluded]: Start isIncluded. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5678412312677197) internal successors, (3871), 2470 states have internal predecessors, (3871), 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 19:45:09,851 INFO L87 Difference]: Start difference. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5678412312677197) internal successors, (3871), 2470 states have internal predecessors, (3871), 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 19:45:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,086 INFO L93 Difference]: Finished difference Result 2473 states and 3872 transitions. [2022-02-20 19:45:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3872 transitions. [2022-02-20 19:45:10,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:10,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:10,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 2471 states, 2469 states have (on average 1.5678412312677197) internal successors, (3871), 2470 states have internal predecessors, (3871), 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 2473 states. [2022-02-20 19:45:10,095 INFO L87 Difference]: Start difference. First operand has 2471 states, 2469 states have (on average 1.5678412312677197) internal successors, (3871), 2470 states have internal predecessors, (3871), 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 2473 states. [2022-02-20 19:45:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,308 INFO L93 Difference]: Finished difference Result 2473 states and 3872 transitions. [2022-02-20 19:45:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3872 transitions. [2022-02-20 19:45:10,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:10,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:10,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:10,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2469 states have (on average 1.5678412312677197) internal successors, (3871), 2470 states have internal predecessors, (3871), 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 19:45:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3871 transitions. [2022-02-20 19:45:10,473 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3871 transitions. Word has length 64 [2022-02-20 19:45:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:10,473 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3871 transitions. [2022-02-20 19:45:10,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3871 transitions. [2022-02-20 19:45:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:10,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:10,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:10,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:45:10,474 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 914325468, now seen corresponding path program 1 times [2022-02-20 19:45:10,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:10,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739408509] [2022-02-20 19:45:10,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:10,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {38735#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {38735#true} is VALID [2022-02-20 19:45:10,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {38735#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {38735#true} is VALID [2022-02-20 19:45:10,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {38735#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38735#true} is VALID [2022-02-20 19:45:10,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {38735#true} assume 0 == ~r1~0; {38735#true} is VALID [2022-02-20 19:45:10,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {38735#true} assume ~id1~0 >= 0; {38735#true} is VALID [2022-02-20 19:45:10,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {38735#true} assume 0 == ~st1~0; {38735#true} is VALID [2022-02-20 19:45:10,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {38735#true} assume ~send1~0 == ~id1~0; {38735#true} is VALID [2022-02-20 19:45:10,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {38735#true} assume 0 == ~mode1~0 % 256; {38735#true} is VALID [2022-02-20 19:45:10,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {38735#true} assume ~id2~0 >= 0; {38735#true} is VALID [2022-02-20 19:45:10,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {38735#true} assume 0 == ~st2~0; {38735#true} is VALID [2022-02-20 19:45:10,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {38735#true} assume ~send2~0 == ~id2~0; {38735#true} is VALID [2022-02-20 19:45:10,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {38735#true} assume 0 == ~mode2~0 % 256; {38735#true} is VALID [2022-02-20 19:45:10,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {38735#true} assume ~id3~0 >= 0; {38735#true} is VALID [2022-02-20 19:45:10,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {38735#true} assume 0 == ~st3~0; {38735#true} is VALID [2022-02-20 19:45:10,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {38735#true} assume ~send3~0 == ~id3~0; {38735#true} is VALID [2022-02-20 19:45:10,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {38735#true} assume 0 == ~mode3~0 % 256; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:10,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {38737#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:45:10,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {38736#false} assume !(node3_~m3~0#1 != ~nomsg~0); {38736#false} is VALID [2022-02-20 19:45:10,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {38736#false} ~mode3~0 := 0; {38736#false} is VALID [2022-02-20 19:45:10,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {38736#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:45:10,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {38736#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:45:10,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {38736#false} assume !(node4_~m4~0#1 != ~nomsg~0); {38736#false} is VALID [2022-02-20 19:45:10,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {38736#false} ~mode4~0 := 0; {38736#false} is VALID [2022-02-20 19:45:10,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {38736#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:45:10,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {38736#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38736#false} is VALID [2022-02-20 19:45:10,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {38736#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38736#false} is VALID [2022-02-20 19:45:10,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {38736#false} ~mode5~0 := 0; {38736#false} is VALID [2022-02-20 19:45:10,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {38736#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38736#false} is VALID [2022-02-20 19:45:10,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {38736#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {38736#false} is VALID [2022-02-20 19:45:10,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {38736#false} check_#res#1 := check_~tmp~1#1; {38736#false} is VALID [2022-02-20 19:45:10,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {38736#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38736#false} is VALID [2022-02-20 19:45:10,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {38736#false} assume 0 == assert_~arg#1 % 256; {38736#false} is VALID [2022-02-20 19:45:10,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {38736#false} assume !false; {38736#false} is VALID [2022-02-20 19:45:10,571 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 19:45:10,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:10,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739408509] [2022-02-20 19:45:10,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739408509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:10,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:10,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:10,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300830246] [2022-02-20 19:45:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:10,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:10,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:10,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:10,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:10,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:10,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:10,615 INFO L87 Difference]: Start difference. First operand 2471 states and 3871 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:12,551 INFO L93 Difference]: Finished difference Result 2803 states and 4393 transitions. [2022-02-20 19:45:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:12,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions. [2022-02-20 19:45:14,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1712 edges. 1712 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:14,187 INFO L225 Difference]: With dead ends: 2803 [2022-02-20 19:45:14,187 INFO L226 Difference]: Without dead ends: 2625 [2022-02-20 19:45:14,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:14,189 INFO L933 BasicCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:14,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-02-20 19:45:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2623. [2022-02-20 19:45:14,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:14,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.566959175887066) internal successors, (4107), 2622 states have internal predecessors, (4107), 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 19:45:14,302 INFO L74 IsIncluded]: Start isIncluded. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.566959175887066) internal successors, (4107), 2622 states have internal predecessors, (4107), 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 19:45:14,305 INFO L87 Difference]: Start difference. First operand 2625 states. Second operand has 2623 states, 2621 states have (on average 1.566959175887066) internal successors, (4107), 2622 states have internal predecessors, (4107), 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 19:45:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:14,527 INFO L93 Difference]: Finished difference Result 2625 states and 4108 transitions. [2022-02-20 19:45:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 4108 transitions. [2022-02-20 19:45:14,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:14,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:14,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 2623 states, 2621 states have (on average 1.566959175887066) internal successors, (4107), 2622 states have internal predecessors, (4107), 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 2625 states. [2022-02-20 19:45:14,534 INFO L87 Difference]: Start difference. First operand has 2623 states, 2621 states have (on average 1.566959175887066) internal successors, (4107), 2622 states have internal predecessors, (4107), 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 2625 states. [2022-02-20 19:45:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:14,794 INFO L93 Difference]: Finished difference Result 2625 states and 4108 transitions. [2022-02-20 19:45:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 4108 transitions. [2022-02-20 19:45:14,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:14,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:14,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:14,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2621 states have (on average 1.566959175887066) internal successors, (4107), 2622 states have internal predecessors, (4107), 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 19:45:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4107 transitions. [2022-02-20 19:45:14,982 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4107 transitions. Word has length 64 [2022-02-20 19:45:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:14,983 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 4107 transitions. [2022-02-20 19:45:14,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4107 transitions. [2022-02-20 19:45:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:14,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:14,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:14,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:45:14,984 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1701027568, now seen corresponding path program 1 times [2022-02-20 19:45:14,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:14,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238296523] [2022-02-20 19:45:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:15,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {49608#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {49608#true} is VALID [2022-02-20 19:45:15,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {49608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~ret49#1, main_#t~ret50#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647; {49608#true} is VALID [2022-02-20 19:45:15,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {49608#true} assume 0 != main_#t~nondet48#1;havoc main_#t~nondet48#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_#t~post33#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {49608#true} is VALID [2022-02-20 19:45:15,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {49608#true} assume 0 == ~r1~0; {49608#true} is VALID [2022-02-20 19:45:15,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {49608#true} assume ~id1~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:15,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {49608#true} assume 0 == ~st1~0; {49608#true} is VALID [2022-02-20 19:45:15,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {49608#true} assume ~send1~0 == ~id1~0; {49608#true} is VALID [2022-02-20 19:45:15,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {49608#true} assume 0 == ~mode1~0 % 256; {49608#true} is VALID [2022-02-20 19:45:15,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {49608#true} assume ~id2~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:15,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {49608#true} assume 0 == ~st2~0; {49608#true} is VALID [2022-02-20 19:45:15,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {49608#true} assume ~send2~0 == ~id2~0; {49608#true} is VALID [2022-02-20 19:45:15,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {49608#true} assume 0 == ~mode2~0 % 256; {49608#true} is VALID [2022-02-20 19:45:15,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {49608#true} assume ~id3~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:15,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {49608#true} assume 0 == ~st3~0; {49608#true} is VALID [2022-02-20 19:45:15,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {49608#true} assume ~send3~0 == ~id3~0; {49608#true} is VALID [2022-02-20 19:45:15,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {49608#true} assume 0 == ~mode3~0 % 256; {49608#true} is VALID [2022-02-20 19:45:15,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {49608#true} assume ~id4~0 >= 0; {49608#true} is VALID [2022-02-20 19:45:15,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {49608#true} assume 0 == ~st4~0; {49608#true} is VALID [2022-02-20 19:45:15,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {49608#true} assume ~send4~0 == ~id4~0; {49608#true} is VALID [2022-02-20 19:45:15,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {49608#true} assume 0 == ~mode4~0 % 256; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:15,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {49610#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {49609#false} is VALID [2022-02-20 19:45:15,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {49609#false} assume !(node4_~m4~0#1 != ~nomsg~0); {49609#false} is VALID [2022-02-20 19:45:15,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {49609#false} ~mode4~0 := 0; {49609#false} is VALID [2022-02-20 19:45:15,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {49609#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {49609#false} is VALID [2022-02-20 19:45:15,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {49609#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49609#false} is VALID [2022-02-20 19:45:15,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {49609#false} assume !(node5_~m5~0#1 != ~nomsg~0); {49609#false} is VALID [2022-02-20 19:45:15,104 INFO L290 TraceCheckUtils]: 57: Hoare triple {49609#false} ~mode5~0 := 0; {49609#false} is VALID [2022-02-20 19:45:15,104 INFO L290 TraceCheckUtils]: 58: Hoare triple {49609#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {49609#false} is VALID [2022-02-20 19:45:15,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {49609#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {49609#false} is VALID [2022-02-20 19:45:15,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {49609#false} check_#res#1 := check_~tmp~1#1; {49609#false} is VALID [2022-02-20 19:45:15,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {49609#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {49609#false} is VALID [2022-02-20 19:45:15,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {49609#false} assume 0 == assert_~arg#1 % 256; {49609#false} is VALID [2022-02-20 19:45:15,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {49609#false} assume !false; {49609#false} is VALID [2022-02-20 19:45:15,109 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 19:45:15,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:15,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238296523] [2022-02-20 19:45:15,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238296523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:15,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:15,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:15,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563626542] [2022-02-20 19:45:15,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:15,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:15,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:15,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:15,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:15,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:15,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:15,155 INFO L87 Difference]: Start difference. First operand 2623 states and 4107 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:17,249 INFO L93 Difference]: Finished difference Result 3235 states and 5061 transitions. [2022-02-20 19:45:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2022-02-20 19:45:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 19:45:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2022-02-20 19:45:17,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1712 transitions.