./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.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.7.ufo.BOUNDED-14.pals+Problem12_label05.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 42bba35470723c3ed0bb104994d7663c79c9e18425de9896b18a2c3627effd61 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:49:53,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:49:53,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:49:53,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:49:53,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:49:53,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:49:53,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:49:53,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:49:53,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:49:53,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:49:53,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:49:53,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:49:53,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:49:53,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:49:53,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:49:53,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:49:53,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:49:53,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:49:53,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:49:53,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:49:53,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:49:53,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:49:53,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:49:53,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:49:53,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:49:53,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:49:53,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:49:53,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:49:53,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:49:53,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:49:53,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:49:53,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:49:53,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:49:53,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:49:53,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:49:53,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:49:53,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:49:53,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:49:53,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:49:53,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:49:53,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:49:53,318 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:49:53,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:49:53,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:49:53,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:49:53,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:49:53,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:49:53,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:49:53,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:49:53,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:49:53,342 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:49:53,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:49:53,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:49:53,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:49:53,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:49:53,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:49:53,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:49:53,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:49:53,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:49:53,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:49:53,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:53,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:49:53,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:49:53,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:49:53,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:49:53,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:49:53,346 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:49:53,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:49:53,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:49:53,347 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 -> 42bba35470723c3ed0bb104994d7663c79c9e18425de9896b18a2c3627effd61 [2022-02-20 19:49:53,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:49:53,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:49:53,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:49:53,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:49:53,580 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:49:53,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2022-02-20 19:49:53,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18085340a/d15c2c81e2ff4cab864e0fcf7cdc5f09/FLAG870510564 [2022-02-20 19:49:54,128 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:49:54,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2022-02-20 19:49:54,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18085340a/d15c2c81e2ff4cab864e0fcf7cdc5f09/FLAG870510564 [2022-02-20 19:49:54,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18085340a/d15c2c81e2ff4cab864e0fcf7cdc5f09 [2022-02-20 19:49:54,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:49:54,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:49:54,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:49:54,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:49:54,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:49:54,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:49:54" (1/1) ... [2022-02-20 19:49:54,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90f1ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:54, skipping insertion in model container [2022-02-20 19:49:54,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:49:54" (1/1) ... [2022-02-20 19:49:54,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:49:54,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:49:54,830 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.7.ufo.BOUNDED-14.pals+Problem12_label05.c[20426,20439] [2022-02-20 19:49:54,877 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.7.ufo.BOUNDED-14.pals+Problem12_label05.c[27362,27375] [2022-02-20 19:49:55,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:49:55,330 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:49:55,369 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.7.ufo.BOUNDED-14.pals+Problem12_label05.c[20426,20439] [2022-02-20 19:49:55,384 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.7.ufo.BOUNDED-14.pals+Problem12_label05.c[27362,27375] [2022-02-20 19:49:55,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:49:55,689 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:49:55,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55 WrapperNode [2022-02-20 19:49:55,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:49:55,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:49:55,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:49:55,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:49:55,696 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:49:55" (1/1) ... [2022-02-20 19:49:55,750 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:49:55" (1/1) ... [2022-02-20 19:49:56,149 INFO L137 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5210 [2022-02-20 19:49:56,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:49:56,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:49:56,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:49:56,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:49:56,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:49:56,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:49:56,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:49:56,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:49:56,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (1/1) ... [2022-02-20 19:49:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:56,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:49:56,622 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:49:56,743 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:49:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:49:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:49:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:49:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:49:56,886 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:49:56,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:50:03,437 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:50:03,447 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:50:03,448 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:50:03,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:03 BoogieIcfgContainer [2022-02-20 19:50:03,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:50:03,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:50:03,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:50:03,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:50:03,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:49:54" (1/3) ... [2022-02-20 19:50:03,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1e5a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:03, skipping insertion in model container [2022-02-20 19:50:03,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:55" (2/3) ... [2022-02-20 19:50:03,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1e5a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:03, skipping insertion in model container [2022-02-20 19:50:03,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:03" (3/3) ... [2022-02-20 19:50:03,455 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label05.c [2022-02-20 19:50:03,458 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:50:03,458 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:50:03,502 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:50:03,508 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:50:03,508 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:50:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 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:50:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:03,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:03,554 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] [2022-02-20 19:50:03,554 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 720070723, now seen corresponding path program 1 times [2022-02-20 19:50:03,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:03,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037662395] [2022-02-20 19:50:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:03,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {947#true} is VALID [2022-02-20 19:50:03,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {947#true} is VALID [2022-02-20 19:50:03,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {947#true} is VALID [2022-02-20 19:50:03,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {947#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {947#true} is VALID [2022-02-20 19:50:03,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {947#true} init_#res#1 := init_~tmp~0#1; {947#true} is VALID [2022-02-20 19:50:03,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {947#true} is VALID [2022-02-20 19:50:03,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {947#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {948#false} is VALID [2022-02-20 19:50:03,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {948#false} is VALID [2022-02-20 19:50:03,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#false} assume !!(main1_~i2~0#1 < 14);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; {948#false} is VALID [2022-02-20 19:50:03,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {948#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#false} assume !(node1_~m1~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:50:03,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {948#false} ~mode1~0 := 0; {948#false} is VALID [2022-02-20 19:50:03,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {948#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; {948#false} is VALID [2022-02-20 19:50:03,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {948#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#false} assume !(node2_~m2~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:50:03,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#false} ~mode2~0 := 0; {948#false} is VALID [2022-02-20 19:50:03,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {948#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; {948#false} is VALID [2022-02-20 19:50:03,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {948#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {948#false} assume !(node3_~m3~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:50:03,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#false} ~mode3~0 := 0; {948#false} is VALID [2022-02-20 19:50:03,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {948#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; {948#false} is VALID [2022-02-20 19:50:03,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {948#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {948#false} assume !(node4_~m4~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:50:03,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {948#false} ~mode4~0 := 0; {948#false} is VALID [2022-02-20 19:50:03,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {948#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; {948#false} is VALID [2022-02-20 19:50:03,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {948#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#false} assume !(node5_~m5~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:50:03,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {948#false} ~mode5~0 := 0; {948#false} is VALID [2022-02-20 19:50:03,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {948#false} assume !(0 != ~mode6~0 % 256); {948#false} is VALID [2022-02-20 19:50:03,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {948#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {948#false} is VALID [2022-02-20 19:50:03,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {948#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {948#false} is VALID [2022-02-20 19:50:03,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {948#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:50:03,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {948#false} assume !(0 != ~mode7~0 % 256); {948#false} is VALID [2022-02-20 19:50:03,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {948#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {948#false} is VALID [2022-02-20 19:50:03,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {948#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {948#false} is VALID [2022-02-20 19:50:03,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {948#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {948#false} is VALID [2022-02-20 19:50:03,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {948#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {948#false} is VALID [2022-02-20 19:50:03,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {948#false} check_#res#1 := check_~tmp~1#1; {948#false} is VALID [2022-02-20 19:50:03,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {948#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {948#false} is VALID [2022-02-20 19:50:03,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {948#false} assume 0 == assert_~arg#1 % 256; {948#false} is VALID [2022-02-20 19:50:03,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 19:50:03,734 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:50:03,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:03,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037662395] [2022-02-20 19:50:03,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037662395] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:03,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:03,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:03,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98354558] [2022-02-20 19:50:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:03,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:50:03,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:03,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:03,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:03,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:50:03,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:03,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:50:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:50:03,791 INFO L87 Difference]: Start difference. First operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:05,009 INFO L93 Difference]: Finished difference Result 1832 states and 3464 transitions. [2022-02-20 19:50:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:50:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:50:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3464 transitions. [2022-02-20 19:50:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3464 transitions. [2022-02-20 19:50:05,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3464 transitions. [2022-02-20 19:50:07,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3464 edges. 3464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:07,497 INFO L225 Difference]: With dead ends: 1832 [2022-02-20 19:50:07,497 INFO L226 Difference]: Without dead ends: 878 [2022-02-20 19:50:07,501 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:50:07,505 INFO L933 BasicCegarLoop]: 1720 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, 1720 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:50:07,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-02-20 19:50:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-02-20 19:50:07,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:07,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 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:50:07,562 INFO L74 IsIncluded]: Start isIncluded. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 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:50:07,565 INFO L87 Difference]: Start difference. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 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:50:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:07,599 INFO L93 Difference]: Finished difference Result 878 states and 1653 transitions. [2022-02-20 19:50:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:50:07,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:07,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:07,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 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 878 states. [2022-02-20 19:50:07,605 INFO L87 Difference]: Start difference. First operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 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 878 states. [2022-02-20 19:50:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:07,633 INFO L93 Difference]: Finished difference Result 878 states and 1653 transitions. [2022-02-20 19:50:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:50:07,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:07,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:07,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:07,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 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:50:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1653 transitions. [2022-02-20 19:50:07,666 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1653 transitions. Word has length 42 [2022-02-20 19:50:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:07,667 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1653 transitions. [2022-02-20 19:50:07,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:50:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:07,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:07,668 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] [2022-02-20 19:50:07,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:50:07,668 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 325703937, now seen corresponding path program 1 times [2022-02-20 19:50:07,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:07,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446682188] [2022-02-20 19:50:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:07,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {5468#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {5468#true} is VALID [2022-02-20 19:50:07,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5468#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {5468#true} is VALID [2022-02-20 19:50:07,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5468#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5468#true} is VALID [2022-02-20 19:50:07,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {5468#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5470#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:50:07,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {5470#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5471#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:50:07,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {5471#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {5472#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:50:07,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {5472#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5469#false} is VALID [2022-02-20 19:50:07,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {5469#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5469#false} is VALID [2022-02-20 19:50:07,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {5469#false} assume !!(main1_~i2~0#1 < 14);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; {5469#false} is VALID [2022-02-20 19:50:07,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {5469#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {5469#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:50:07,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {5469#false} ~mode1~0 := 0; {5469#false} is VALID [2022-02-20 19:50:07,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {5469#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; {5469#false} is VALID [2022-02-20 19:50:07,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {5469#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {5469#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:50:07,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {5469#false} ~mode2~0 := 0; {5469#false} is VALID [2022-02-20 19:50:07,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {5469#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; {5469#false} is VALID [2022-02-20 19:50:07,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {5469#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {5469#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:50:07,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {5469#false} ~mode3~0 := 0; {5469#false} is VALID [2022-02-20 19:50:07,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {5469#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; {5469#false} is VALID [2022-02-20 19:50:07,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {5469#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {5469#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:50:07,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {5469#false} ~mode4~0 := 0; {5469#false} is VALID [2022-02-20 19:50:07,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {5469#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; {5469#false} is VALID [2022-02-20 19:50:07,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {5469#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {5469#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:50:07,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {5469#false} ~mode5~0 := 0; {5469#false} is VALID [2022-02-20 19:50:07,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {5469#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {5469#false} assume !(0 != ~mode6~0 % 256); {5469#false} is VALID [2022-02-20 19:50:07,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {5469#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {5469#false} is VALID [2022-02-20 19:50:07,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {5469#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {5469#false} is VALID [2022-02-20 19:50:07,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {5469#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:50:07,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {5469#false} assume !(0 != ~mode7~0 % 256); {5469#false} is VALID [2022-02-20 19:50:07,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {5469#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {5469#false} is VALID [2022-02-20 19:50:07,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {5469#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {5469#false} is VALID [2022-02-20 19:50:07,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {5469#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5469#false} is VALID [2022-02-20 19:50:07,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {5469#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {5469#false} is VALID [2022-02-20 19:50:07,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {5469#false} check_#res#1 := check_~tmp~1#1; {5469#false} is VALID [2022-02-20 19:50:07,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {5469#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {5469#false} is VALID [2022-02-20 19:50:07,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {5469#false} assume 0 == assert_~arg#1 % 256; {5469#false} is VALID [2022-02-20 19:50:07,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {5469#false} assume !false; {5469#false} is VALID [2022-02-20 19:50:07,746 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:50:07,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:07,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446682188] [2022-02-20 19:50:07,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446682188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:07,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:07,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:50:07,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249459876] [2022-02-20 19:50:07,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:07,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:50:07,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:07,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:07,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:07,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:50:07,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:50:07,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:50:07,799 INFO L87 Difference]: Start difference. First operand 878 states and 1653 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:11,663 INFO L93 Difference]: Finished difference Result 950 states and 1765 transitions. [2022-02-20 19:50:11,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:50:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:50:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:11,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1765 transitions. [2022-02-20 19:50:12,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1765 edges. 1765 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:12,951 INFO L225 Difference]: With dead ends: 950 [2022-02-20 19:50:12,952 INFO L226 Difference]: Without dead ends: 878 [2022-02-20 19:50:12,955 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:50:12,956 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 3 mSDsluCounter, 4900 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6551 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:12,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6551 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-02-20 19:50:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-02-20 19:50:12,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:12,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 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:50:12,975 INFO L74 IsIncluded]: Start isIncluded. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 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:50:12,978 INFO L87 Difference]: Start difference. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 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:50:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:13,043 INFO L93 Difference]: Finished difference Result 878 states and 1603 transitions. [2022-02-20 19:50:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:50:13,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:13,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:13,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 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 878 states. [2022-02-20 19:50:13,053 INFO L87 Difference]: Start difference. First operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 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 878 states. [2022-02-20 19:50:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:13,081 INFO L93 Difference]: Finished difference Result 878 states and 1603 transitions. [2022-02-20 19:50:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:50:13,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:13,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:13,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:13,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 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:50:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1603 transitions. [2022-02-20 19:50:13,114 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1603 transitions. Word has length 42 [2022-02-20 19:50:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:13,114 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1603 transitions. [2022-02-20 19:50:13,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:50:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 19:50:13,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:13,121 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] [2022-02-20 19:50:13,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:50:13,121 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -537240347, now seen corresponding path program 1 times [2022-02-20 19:50:13,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:13,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965587484] [2022-02-20 19:50:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:13,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:13,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {9106#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet58#1);havoc main_#t~nondet58#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet56#1, main2_#t~ret57#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet56#1 && main2_#t~nondet56#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet56#1;havoc main2_#t~nondet56#1; {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {9108#(<= (+ ~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~ret53#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9108#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:13,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {9108#(<= (+ ~a17~0 124) 0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9107#false} is VALID [2022-02-20 19:50:13,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {9107#false} assume !false; {9107#false} is VALID [2022-02-20 19:50:13,311 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:50:13,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:13,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965587484] [2022-02-20 19:50:13,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965587484] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:13,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:13,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:13,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324522441] [2022-02-20 19:50:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2022-02-20 19:50:13,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:13,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:50:13,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:13,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:13,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:13,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:13,355 INFO L87 Difference]: Start difference. First operand 878 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:50:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:18,461 INFO L93 Difference]: Finished difference Result 2382 states and 4476 transitions. [2022-02-20 19:50:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2022-02-20 19:50:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:50:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4476 transitions. [2022-02-20 19:50:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:50:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4476 transitions. [2022-02-20 19:50:18,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4476 transitions. [2022-02-20 19:50:22,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4476 edges. 4476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:22,139 INFO L225 Difference]: With dead ends: 2382 [2022-02-20 19:50:22,139 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:50:22,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:50:22,142 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 905 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:22,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [905 Valid, 639 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:50:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:50:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:50:22,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:22,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 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:50:22,174 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 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:50:22,176 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 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:50:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:22,260 INFO L93 Difference]: Finished difference Result 1629 states and 2582 transitions. [2022-02-20 19:50:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2582 transitions. [2022-02-20 19:50:22,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:22,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:22,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 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 1629 states. [2022-02-20 19:50:22,273 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 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 1629 states. [2022-02-20 19:50:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:22,358 INFO L93 Difference]: Finished difference Result 1629 states and 2582 transitions. [2022-02-20 19:50:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2582 transitions. [2022-02-20 19:50:22,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:22,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:22,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:22,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 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:50:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2582 transitions. [2022-02-20 19:50:22,460 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2582 transitions. Word has length 60 [2022-02-20 19:50:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:22,461 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2582 transitions. [2022-02-20 19:50:22,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:50:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2582 transitions. [2022-02-20 19:50:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:22,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:22,465 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, 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:50:22,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:50:22,466 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1207745120, now seen corresponding path program 1 times [2022-02-20 19:50:22,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:22,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781797531] [2022-02-20 19:50:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:22,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:22,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {16427#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {16427#true} is VALID [2022-02-20 19:50:22,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {16427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {16427#true} is VALID [2022-02-20 19:50:22,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {16427#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16427#true} is VALID [2022-02-20 19:50:22,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {16427#true} assume 0 == ~r1~0; {16427#true} is VALID [2022-02-20 19:50:22,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {16427#true} assume ~id1~0 >= 0; {16427#true} is VALID [2022-02-20 19:50:22,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {16427#true} assume 0 == ~st1~0; {16427#true} is VALID [2022-02-20 19:50:22,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {16427#true} assume ~send1~0 == ~id1~0; {16427#true} is VALID [2022-02-20 19:50:22,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {16427#true} assume 0 == ~mode1~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {16429#(= (+ (* (- 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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 14);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; {16429#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:22,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {16429#(= (+ (* (- 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {16428#false} assume !(node1_~m1~0#1 != ~nomsg~0); {16428#false} is VALID [2022-02-20 19:50:22,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {16428#false} ~mode1~0 := 0; {16428#false} is VALID [2022-02-20 19:50:22,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {16428#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; {16428#false} is VALID [2022-02-20 19:50:22,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {16428#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {16428#false} assume !(node2_~m2~0#1 != ~nomsg~0); {16428#false} is VALID [2022-02-20 19:50:22,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {16428#false} ~mode2~0 := 0; {16428#false} is VALID [2022-02-20 19:50:22,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {16428#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; {16428#false} is VALID [2022-02-20 19:50:22,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {16428#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,631 INFO L290 TraceCheckUtils]: 67: Hoare triple {16428#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16428#false} is VALID [2022-02-20 19:50:22,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {16428#false} ~mode3~0 := 0; {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {16428#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; {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 70: Hoare triple {16428#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {16428#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 72: Hoare triple {16428#false} ~mode4~0 := 0; {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {16428#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; {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {16428#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,633 INFO L290 TraceCheckUtils]: 75: Hoare triple {16428#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {16428#false} ~mode5~0 := 0; {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {16428#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {16428#false} assume !(0 != ~mode6~0 % 256); {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 79: Hoare triple {16428#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {16428#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 81: Hoare triple {16428#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {16428#false} is VALID [2022-02-20 19:50:22,634 INFO L290 TraceCheckUtils]: 82: Hoare triple {16428#false} assume !(0 != ~mode7~0 % 256); {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {16428#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 84: Hoare triple {16428#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {16428#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {16428#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 87: Hoare triple {16428#false} check_#res#1 := check_~tmp~1#1; {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 88: Hoare triple {16428#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {16428#false} is VALID [2022-02-20 19:50:22,635 INFO L290 TraceCheckUtils]: 89: Hoare triple {16428#false} assume 0 == assert_~arg#1 % 256; {16428#false} is VALID [2022-02-20 19:50:22,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {16428#false} assume !false; {16428#false} is VALID [2022-02-20 19:50:22,636 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:50:22,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:22,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781797531] [2022-02-20 19:50:22,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781797531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:22,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:22,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:22,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332643104] [2022-02-20 19:50:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:22,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:22,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:22,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:22,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:22,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:22,713 INFO L87 Difference]: Start difference. First operand 1629 states and 2582 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:24,546 INFO L93 Difference]: Finished difference Result 1759 states and 2788 transitions. [2022-02-20 19:50:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:24,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:24,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:26,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:26,104 INFO L225 Difference]: With dead ends: 1759 [2022-02-20 19:50:26,104 INFO L226 Difference]: Without dead ends: 1691 [2022-02-20 19:50:26,105 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:50:26,107 INFO L933 BasicCegarLoop]: 1697 mSDtfsCounter, 1537 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1803 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:50:26,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1803 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-02-20 19:50:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2022-02-20 19:50:26,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:26,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.5874333135743923) internal successors, (2678), 1688 states have internal predecessors, (2678), 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:50:26,173 INFO L74 IsIncluded]: Start isIncluded. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.5874333135743923) internal successors, (2678), 1688 states have internal predecessors, (2678), 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:50:26,175 INFO L87 Difference]: Start difference. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.5874333135743923) internal successors, (2678), 1688 states have internal predecessors, (2678), 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:50:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:26,278 INFO L93 Difference]: Finished difference Result 1691 states and 2679 transitions. [2022-02-20 19:50:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2679 transitions. [2022-02-20 19:50:26,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:26,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:26,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 1689 states, 1687 states have (on average 1.5874333135743923) internal successors, (2678), 1688 states have internal predecessors, (2678), 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 1691 states. [2022-02-20 19:50:26,284 INFO L87 Difference]: Start difference. First operand has 1689 states, 1687 states have (on average 1.5874333135743923) internal successors, (2678), 1688 states have internal predecessors, (2678), 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 1691 states. [2022-02-20 19:50:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:26,369 INFO L93 Difference]: Finished difference Result 1691 states and 2679 transitions. [2022-02-20 19:50:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2679 transitions. [2022-02-20 19:50:26,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:26,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:26,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:26,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5874333135743923) internal successors, (2678), 1688 states have internal predecessors, (2678), 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:50:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2678 transitions. [2022-02-20 19:50:26,462 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2678 transitions. Word has length 91 [2022-02-20 19:50:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:26,463 INFO L470 AbstractCegarLoop]: Abstraction has 1689 states and 2678 transitions. [2022-02-20 19:50:26,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2678 transitions. [2022-02-20 19:50:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:26,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:26,464 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, 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:50:26,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:50:26,465 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1564953708, now seen corresponding path program 1 times [2022-02-20 19:50:26,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:26,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988315683] [2022-02-20 19:50:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:26,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:26,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {23334#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {23334#true} is VALID [2022-02-20 19:50:26,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {23334#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {23334#true} is VALID [2022-02-20 19:50:26,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {23334#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23334#true} is VALID [2022-02-20 19:50:26,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {23334#true} assume 0 == ~r1~0; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {23334#true} assume ~id1~0 >= 0; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {23334#true} assume 0 == ~st1~0; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {23334#true} assume ~send1~0 == ~id1~0; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {23334#true} assume 0 == ~mode1~0 % 256; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {23334#true} assume ~id2~0 >= 0; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {23334#true} assume 0 == ~st2~0; {23334#true} is VALID [2022-02-20 19:50:26,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {23334#true} assume ~send2~0 == ~id2~0; {23334#true} is VALID [2022-02-20 19:50:26,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {23334#true} assume 0 == ~mode2~0 % 256; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {23336#(= (+ (* (- 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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 14);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; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,572 INFO L290 TraceCheckUtils]: 59: Hoare triple {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {23336#(= (+ (* (- 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; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {23336#(= (+ (* (- 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; {23336#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:26,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {23336#(= (+ (* (- 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; {23335#false} is VALID [2022-02-20 19:50:26,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {23335#false} assume !(node2_~m2~0#1 != ~nomsg~0); {23335#false} is VALID [2022-02-20 19:50:26,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {23335#false} ~mode2~0 := 0; {23335#false} is VALID [2022-02-20 19:50:26,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {23335#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; {23335#false} is VALID [2022-02-20 19:50:26,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {23335#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23335#false} is VALID [2022-02-20 19:50:26,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {23335#false} assume !(node3_~m3~0#1 != ~nomsg~0); {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {23335#false} ~mode3~0 := 0; {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {23335#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; {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {23335#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {23335#false} assume !(node4_~m4~0#1 != ~nomsg~0); {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {23335#false} ~mode4~0 := 0; {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {23335#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; {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {23335#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23335#false} is VALID [2022-02-20 19:50:26,574 INFO L290 TraceCheckUtils]: 75: Hoare triple {23335#false} assume !(node5_~m5~0#1 != ~nomsg~0); {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {23335#false} ~mode5~0 := 0; {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {23335#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {23335#false} assume !(0 != ~mode6~0 % 256); {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 79: Hoare triple {23335#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {23335#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {23335#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {23335#false} assume !(0 != ~mode7~0 % 256); {23335#false} is VALID [2022-02-20 19:50:26,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {23335#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 84: Hoare triple {23335#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 85: Hoare triple {23335#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 86: Hoare triple {23335#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 87: Hoare triple {23335#false} check_#res#1 := check_~tmp~1#1; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 88: Hoare triple {23335#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 89: Hoare triple {23335#false} assume 0 == assert_~arg#1 % 256; {23335#false} is VALID [2022-02-20 19:50:26,576 INFO L290 TraceCheckUtils]: 90: Hoare triple {23335#false} assume !false; {23335#false} is VALID [2022-02-20 19:50:26,578 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:50:26,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:26,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988315683] [2022-02-20 19:50:26,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988315683] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:26,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:26,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:26,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547688881] [2022-02-20 19:50:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:26,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:26,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:26,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:26,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:26,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:26,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:26,617 INFO L87 Difference]: Start difference. First operand 1689 states and 2678 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:28,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:28,384 INFO L93 Difference]: Finished difference Result 1933 states and 3066 transitions. [2022-02-20 19:50:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:28,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:28,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:28,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:29,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:30,009 INFO L225 Difference]: With dead ends: 1933 [2022-02-20 19:50:30,009 INFO L226 Difference]: Without dead ends: 1805 [2022-02-20 19:50:30,010 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:50:30,010 INFO L933 BasicCegarLoop]: 1692 mSDtfsCounter, 1533 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1802 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:50:30,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1802 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-02-20 19:50:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2022-02-20 19:50:30,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:30,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.5874514158800666) internal successors, (2859), 1802 states have internal predecessors, (2859), 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:50:30,056 INFO L74 IsIncluded]: Start isIncluded. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.5874514158800666) internal successors, (2859), 1802 states have internal predecessors, (2859), 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:50:30,057 INFO L87 Difference]: Start difference. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.5874514158800666) internal successors, (2859), 1802 states have internal predecessors, (2859), 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:50:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:30,156 INFO L93 Difference]: Finished difference Result 1805 states and 2860 transitions. [2022-02-20 19:50:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2860 transitions. [2022-02-20 19:50:30,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:30,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:30,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 1803 states, 1801 states have (on average 1.5874514158800666) internal successors, (2859), 1802 states have internal predecessors, (2859), 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 1805 states. [2022-02-20 19:50:30,162 INFO L87 Difference]: Start difference. First operand has 1803 states, 1801 states have (on average 1.5874514158800666) internal successors, (2859), 1802 states have internal predecessors, (2859), 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 1805 states. [2022-02-20 19:50:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:30,259 INFO L93 Difference]: Finished difference Result 1805 states and 2860 transitions. [2022-02-20 19:50:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2860 transitions. [2022-02-20 19:50:30,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:30,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:30,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:30,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1801 states have (on average 1.5874514158800666) internal successors, (2859), 1802 states have internal predecessors, (2859), 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:50:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2859 transitions. [2022-02-20 19:50:30,364 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2859 transitions. Word has length 91 [2022-02-20 19:50:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:30,364 INFO L470 AbstractCegarLoop]: Abstraction has 1803 states and 2859 transitions. [2022-02-20 19:50:30,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2859 transitions. [2022-02-20 19:50:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:30,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:30,365 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, 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:50:30,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:50:30,366 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1479108296, now seen corresponding path program 1 times [2022-02-20 19:50:30,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:30,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799318419] [2022-02-20 19:50:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:30,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {30807#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {30807#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {30807#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {30807#true} assume 0 == ~r1~0; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {30807#true} assume ~id1~0 >= 0; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {30807#true} assume 0 == ~st1~0; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {30807#true} assume ~send1~0 == ~id1~0; {30807#true} is VALID [2022-02-20 19:50:30,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {30807#true} assume 0 == ~mode1~0 % 256; {30807#true} is VALID [2022-02-20 19:50:30,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {30807#true} assume ~id2~0 >= 0; {30807#true} is VALID [2022-02-20 19:50:30,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {30807#true} assume 0 == ~st2~0; {30807#true} is VALID [2022-02-20 19:50:30,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {30807#true} assume ~send2~0 == ~id2~0; {30807#true} is VALID [2022-02-20 19:50:30,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {30807#true} assume 0 == ~mode2~0 % 256; {30807#true} is VALID [2022-02-20 19:50:30,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {30807#true} assume ~id3~0 >= 0; {30807#true} is VALID [2022-02-20 19:50:30,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {30807#true} assume 0 == ~st3~0; {30807#true} is VALID [2022-02-20 19:50:30,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {30807#true} assume ~send3~0 == ~id3~0; {30807#true} is VALID [2022-02-20 19:50:30,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {30807#true} assume 0 == ~mode3~0 % 256; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {30809#(= (+ (* (- 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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 14);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; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {30809#(= (+ (* (- 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; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {30809#(= (+ (* (- 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; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {30809#(= (+ (* (- 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; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {30809#(= (+ (* (- 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; {30809#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:30,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {30809#(= (+ (* (- 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; {30808#false} is VALID [2022-02-20 19:50:30,453 INFO L290 TraceCheckUtils]: 67: Hoare triple {30808#false} assume !(node3_~m3~0#1 != ~nomsg~0); {30808#false} is VALID [2022-02-20 19:50:30,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {30808#false} ~mode3~0 := 0; {30808#false} is VALID [2022-02-20 19:50:30,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {30808#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; {30808#false} is VALID [2022-02-20 19:50:30,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {30808#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {30808#false} is VALID [2022-02-20 19:50:30,453 INFO L290 TraceCheckUtils]: 71: Hoare triple {30808#false} assume !(node4_~m4~0#1 != ~nomsg~0); {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {30808#false} ~mode4~0 := 0; {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {30808#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; {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {30808#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {30808#false} assume !(node5_~m5~0#1 != ~nomsg~0); {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {30808#false} ~mode5~0 := 0; {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {30808#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {30808#false} assume !(0 != ~mode6~0 % 256); {30808#false} is VALID [2022-02-20 19:50:30,454 INFO L290 TraceCheckUtils]: 79: Hoare triple {30808#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {30808#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {30808#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 82: Hoare triple {30808#false} assume !(0 != ~mode7~0 % 256); {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {30808#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {30808#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {30808#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {30808#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {30808#false} check_#res#1 := check_~tmp~1#1; {30808#false} is VALID [2022-02-20 19:50:30,455 INFO L290 TraceCheckUtils]: 88: Hoare triple {30808#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {30808#false} is VALID [2022-02-20 19:50:30,456 INFO L290 TraceCheckUtils]: 89: Hoare triple {30808#false} assume 0 == assert_~arg#1 % 256; {30808#false} is VALID [2022-02-20 19:50:30,456 INFO L290 TraceCheckUtils]: 90: Hoare triple {30808#false} assume !false; {30808#false} is VALID [2022-02-20 19:50:30,456 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:50:30,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:30,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799318419] [2022-02-20 19:50:30,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799318419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:30,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:30,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:30,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565929584] [2022-02-20 19:50:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:30,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:30,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:30,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:30,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:30,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:30,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:30,519 INFO L87 Difference]: Start difference. First operand 1803 states and 2859 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:32,260 INFO L93 Difference]: Finished difference Result 2263 states and 3589 transitions. [2022-02-20 19:50:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:32,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:32,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:33,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:33,502 INFO L225 Difference]: With dead ends: 2263 [2022-02-20 19:50:33,502 INFO L226 Difference]: Without dead ends: 2021 [2022-02-20 19:50:33,503 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:50:33,504 INFO L933 BasicCegarLoop]: 1687 mSDtfsCounter, 1529 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1801 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:50:33,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1801 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-02-20 19:50:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2019. [2022-02-20 19:50:33,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:33,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.5860188398611799) internal successors, (3199), 2018 states have internal predecessors, (3199), 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:50:33,581 INFO L74 IsIncluded]: Start isIncluded. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.5860188398611799) internal successors, (3199), 2018 states have internal predecessors, (3199), 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:50:33,584 INFO L87 Difference]: Start difference. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.5860188398611799) internal successors, (3199), 2018 states have internal predecessors, (3199), 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:50:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:33,701 INFO L93 Difference]: Finished difference Result 2021 states and 3200 transitions. [2022-02-20 19:50:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3200 transitions. [2022-02-20 19:50:33,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:33,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:33,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 2019 states, 2017 states have (on average 1.5860188398611799) internal successors, (3199), 2018 states have internal predecessors, (3199), 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 2021 states. [2022-02-20 19:50:33,707 INFO L87 Difference]: Start difference. First operand has 2019 states, 2017 states have (on average 1.5860188398611799) internal successors, (3199), 2018 states have internal predecessors, (3199), 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 2021 states. [2022-02-20 19:50:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:33,825 INFO L93 Difference]: Finished difference Result 2021 states and 3200 transitions. [2022-02-20 19:50:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3200 transitions. [2022-02-20 19:50:33,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:33,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:33,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:33,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2017 states have (on average 1.5860188398611799) internal successors, (3199), 2018 states have internal predecessors, (3199), 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:50:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3199 transitions. [2022-02-20 19:50:33,951 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3199 transitions. Word has length 91 [2022-02-20 19:50:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:33,951 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 3199 transitions. [2022-02-20 19:50:33,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3199 transitions. [2022-02-20 19:50:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:33,956 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:33,956 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, 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:50:33,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:50:33,956 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash 733525566, now seen corresponding path program 1 times [2022-02-20 19:50:33,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:33,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985180412] [2022-02-20 19:50:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:34,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {39358#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {39358#true} is VALID [2022-02-20 19:50:34,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {39358#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {39358#true} is VALID [2022-02-20 19:50:34,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {39358#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39358#true} is VALID [2022-02-20 19:50:34,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {39358#true} assume 0 == ~r1~0; {39358#true} is VALID [2022-02-20 19:50:34,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {39358#true} assume ~id1~0 >= 0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {39358#true} assume 0 == ~st1~0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {39358#true} assume ~send1~0 == ~id1~0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {39358#true} assume 0 == ~mode1~0 % 256; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {39358#true} assume ~id2~0 >= 0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {39358#true} assume 0 == ~st2~0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {39358#true} assume ~send2~0 == ~id2~0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {39358#true} assume 0 == ~mode2~0 % 256; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {39358#true} assume ~id3~0 >= 0; {39358#true} is VALID [2022-02-20 19:50:34,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {39358#true} assume 0 == ~st3~0; {39358#true} is VALID [2022-02-20 19:50:34,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {39358#true} assume ~send3~0 == ~id3~0; {39358#true} is VALID [2022-02-20 19:50:34,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {39358#true} assume 0 == ~mode3~0 % 256; {39358#true} is VALID [2022-02-20 19:50:34,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {39358#true} assume ~id4~0 >= 0; {39358#true} is VALID [2022-02-20 19:50:34,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {39358#true} assume 0 == ~st4~0; {39358#true} is VALID [2022-02-20 19:50:34,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {39358#true} assume ~send4~0 == ~id4~0; {39358#true} is VALID [2022-02-20 19:50:34,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {39358#true} assume 0 == ~mode4~0 % 256; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,030 INFO L290 TraceCheckUtils]: 51: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {39360#(= (+ (* (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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 14);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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {39360#(= (+ (* (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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {39360#(= (+ (* (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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,034 INFO L290 TraceCheckUtils]: 62: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {39360#(= (+ (* (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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {39360#(= (+ (* (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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {39360#(= (+ (* (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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {39360#(= (+ (* (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; {39360#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:34,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {39360#(= (+ (* (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; {39359#false} is VALID [2022-02-20 19:50:34,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {39359#false} assume !(node4_~m4~0#1 != ~nomsg~0); {39359#false} is VALID [2022-02-20 19:50:34,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {39359#false} ~mode4~0 := 0; {39359#false} is VALID [2022-02-20 19:50:34,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {39359#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; {39359#false} is VALID [2022-02-20 19:50:34,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {39359#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {39359#false} is VALID [2022-02-20 19:50:34,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {39359#false} assume !(node5_~m5~0#1 != ~nomsg~0); {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {39359#false} ~mode5~0 := 0; {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {39359#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 78: Hoare triple {39359#false} assume !(0 != ~mode6~0 % 256); {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 79: Hoare triple {39359#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {39359#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {39359#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {39359#false} assume !(0 != ~mode7~0 % 256); {39359#false} is VALID [2022-02-20 19:50:34,038 INFO L290 TraceCheckUtils]: 83: Hoare triple {39359#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {39359#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 85: Hoare triple {39359#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 86: Hoare triple {39359#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 87: Hoare triple {39359#false} check_#res#1 := check_~tmp~1#1; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {39359#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {39359#false} assume 0 == assert_~arg#1 % 256; {39359#false} is VALID [2022-02-20 19:50:34,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {39359#false} assume !false; {39359#false} is VALID [2022-02-20 19:50:34,040 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:50:34,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:34,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985180412] [2022-02-20 19:50:34,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985180412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:34,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:34,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:34,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863524991] [2022-02-20 19:50:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:34,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:34,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:34,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:34,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:34,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:34,080 INFO L87 Difference]: Start difference. First operand 2019 states and 3199 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:35,771 INFO L93 Difference]: Finished difference Result 2887 states and 4569 transitions. [2022-02-20 19:50:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:35,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:37,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:37,273 INFO L225 Difference]: With dead ends: 2887 [2022-02-20 19:50:37,273 INFO L226 Difference]: Without dead ends: 2429 [2022-02-20 19:50:37,288 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:50:37,288 INFO L933 BasicCegarLoop]: 1682 mSDtfsCounter, 1525 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1800 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:50:37,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1525 Valid, 1800 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-02-20 19:50:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2427. [2022-02-20 19:50:37,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:37,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.581443298969072) internal successors, (3835), 2426 states have internal predecessors, (3835), 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:50:37,412 INFO L74 IsIncluded]: Start isIncluded. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.581443298969072) internal successors, (3835), 2426 states have internal predecessors, (3835), 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:50:37,414 INFO L87 Difference]: Start difference. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.581443298969072) internal successors, (3835), 2426 states have internal predecessors, (3835), 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:50:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:37,576 INFO L93 Difference]: Finished difference Result 2429 states and 3836 transitions. [2022-02-20 19:50:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3836 transitions. [2022-02-20 19:50:37,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:37,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:37,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 2427 states, 2425 states have (on average 1.581443298969072) internal successors, (3835), 2426 states have internal predecessors, (3835), 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 2429 states. [2022-02-20 19:50:37,584 INFO L87 Difference]: Start difference. First operand has 2427 states, 2425 states have (on average 1.581443298969072) internal successors, (3835), 2426 states have internal predecessors, (3835), 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 2429 states. [2022-02-20 19:50:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:37,752 INFO L93 Difference]: Finished difference Result 2429 states and 3836 transitions. [2022-02-20 19:50:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3836 transitions. [2022-02-20 19:50:37,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:37,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:37,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:37,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 1.581443298969072) internal successors, (3835), 2426 states have internal predecessors, (3835), 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:50:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3835 transitions. [2022-02-20 19:50:37,942 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3835 transitions. Word has length 91 [2022-02-20 19:50:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:37,943 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 3835 transitions. [2022-02-20 19:50:37,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3835 transitions. [2022-02-20 19:50:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:37,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:37,944 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, 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:50:37,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:50:37,944 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:37,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1206505292, now seen corresponding path program 1 times [2022-02-20 19:50:37,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:37,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517718776] [2022-02-20 19:50:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:37,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {49957#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {49957#true} is VALID [2022-02-20 19:50:37,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {49957#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {49957#true} is VALID [2022-02-20 19:50:37,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {49957#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {49957#true} is VALID [2022-02-20 19:50:37,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {49957#true} assume 0 == ~r1~0; {49957#true} is VALID [2022-02-20 19:50:37,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {49957#true} assume ~id1~0 >= 0; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {49957#true} assume 0 == ~st1~0; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {49957#true} assume ~send1~0 == ~id1~0; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {49957#true} assume 0 == ~mode1~0 % 256; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {49957#true} assume ~id2~0 >= 0; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {49957#true} assume 0 == ~st2~0; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {49957#true} assume ~send2~0 == ~id2~0; {49957#true} is VALID [2022-02-20 19:50:37,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {49957#true} assume 0 == ~mode2~0 % 256; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {49957#true} assume ~id3~0 >= 0; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {49957#true} assume 0 == ~st3~0; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {49957#true} assume ~send3~0 == ~id3~0; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {49957#true} assume 0 == ~mode3~0 % 256; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {49957#true} assume ~id4~0 >= 0; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {49957#true} assume 0 == ~st4~0; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {49957#true} assume ~send4~0 == ~id4~0; {49957#true} is VALID [2022-02-20 19:50:37,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {49957#true} assume 0 == ~mode4~0 % 256; {49957#true} is VALID [2022-02-20 19:50:37,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {49957#true} assume ~id5~0 >= 0; {49957#true} is VALID [2022-02-20 19:50:37,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {49957#true} assume 0 == ~st5~0; {49957#true} is VALID [2022-02-20 19:50:37,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {49957#true} assume ~send5~0 == ~id5~0; {49957#true} is VALID [2022-02-20 19:50:37,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {49957#true} assume 0 == ~mode5~0 % 256; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:37,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 14);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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,011 INFO L290 TraceCheckUtils]: 67: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,012 INFO L290 TraceCheckUtils]: 69: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,013 INFO L290 TraceCheckUtils]: 72: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,013 INFO L290 TraceCheckUtils]: 73: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} 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; {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 74: Hoare triple {49959#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {49958#false} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 75: Hoare triple {49958#false} assume !(node5_~m5~0#1 != ~nomsg~0); {49958#false} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {49958#false} ~mode5~0 := 0; {49958#false} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {49958#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {49958#false} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 78: Hoare triple {49958#false} assume !(0 != ~mode6~0 % 256); {49958#false} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 79: Hoare triple {49958#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {49958#false} is VALID [2022-02-20 19:50:38,014 INFO L290 TraceCheckUtils]: 80: Hoare triple {49958#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 81: Hoare triple {49958#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 82: Hoare triple {49958#false} assume !(0 != ~mode7~0 % 256); {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 83: Hoare triple {49958#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 84: Hoare triple {49958#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 85: Hoare triple {49958#false} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {49958#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {49958#false} is VALID [2022-02-20 19:50:38,015 INFO L290 TraceCheckUtils]: 87: Hoare triple {49958#false} check_#res#1 := check_~tmp~1#1; {49958#false} is VALID [2022-02-20 19:50:38,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {49958#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {49958#false} is VALID [2022-02-20 19:50:38,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {49958#false} assume 0 == assert_~arg#1 % 256; {49958#false} is VALID [2022-02-20 19:50:38,016 INFO L290 TraceCheckUtils]: 90: Hoare triple {49958#false} assume !false; {49958#false} is VALID [2022-02-20 19:50:38,016 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:50:38,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:38,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517718776] [2022-02-20 19:50:38,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517718776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:38,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:38,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:38,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061650772] [2022-02-20 19:50:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:38,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:38,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:38,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:38,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:38,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:38,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:38,081 INFO L87 Difference]: Start difference. First operand 2427 states and 3835 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:40,455 INFO L93 Difference]: Finished difference Result 4063 states and 6397 transitions. [2022-02-20 19:50:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:40,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:40,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:41,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:42,330 INFO L225 Difference]: With dead ends: 4063 [2022-02-20 19:50:42,331 INFO L226 Difference]: Without dead ends: 3197 [2022-02-20 19:50:42,333 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:50:42,333 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1799 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:50:42,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 1799 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2022-02-20 19:50:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3195. [2022-02-20 19:50:42,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:42,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.5718759787034138) internal successors, (5019), 3194 states have internal predecessors, (5019), 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:50:42,586 INFO L74 IsIncluded]: Start isIncluded. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.5718759787034138) internal successors, (5019), 3194 states have internal predecessors, (5019), 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:50:42,588 INFO L87 Difference]: Start difference. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.5718759787034138) internal successors, (5019), 3194 states have internal predecessors, (5019), 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:50:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:42,893 INFO L93 Difference]: Finished difference Result 3197 states and 5020 transitions. [2022-02-20 19:50:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5020 transitions. [2022-02-20 19:50:42,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:42,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:42,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 3195 states, 3193 states have (on average 1.5718759787034138) internal successors, (5019), 3194 states have internal predecessors, (5019), 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 3197 states. [2022-02-20 19:50:42,900 INFO L87 Difference]: Start difference. First operand has 3195 states, 3193 states have (on average 1.5718759787034138) internal successors, (5019), 3194 states have internal predecessors, (5019), 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 3197 states. [2022-02-20 19:50:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:43,201 INFO L93 Difference]: Finished difference Result 3197 states and 5020 transitions. [2022-02-20 19:50:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5020 transitions. [2022-02-20 19:50:43,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:43,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:43,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:43,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3195 states, 3193 states have (on average 1.5718759787034138) internal successors, (5019), 3194 states have internal predecessors, (5019), 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:50:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 5019 transitions. [2022-02-20 19:50:43,558 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 5019 transitions. Word has length 91 [2022-02-20 19:50:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:43,558 INFO L470 AbstractCegarLoop]: Abstraction has 3195 states and 5019 transitions. [2022-02-20 19:50:43,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:50:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 5019 transitions. [2022-02-20 19:50:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:43,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:43,560 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, 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:50:43,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:50:43,560 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1494177322, now seen corresponding path program 1 times [2022-02-20 19:50:43,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:43,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639982549] [2022-02-20 19:50:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:43,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {64436#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~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; {64436#true} is VALID [2022-02-20 19:50:43,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {64436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {64436#true} is VALID [2022-02-20 19:50:43,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {64436#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#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~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64436#true} is VALID [2022-02-20 19:50:43,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {64436#true} assume 0 == ~r1~0; {64436#true} is VALID [2022-02-20 19:50:43,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {64436#true} assume ~id1~0 >= 0; {64436#true} is VALID [2022-02-20 19:50:43,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {64436#true} assume 0 == ~st1~0; {64438#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:43,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {64438#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {64438#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:43,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {64438#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {64438#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:43,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {64438#(<= ~st1~0 0)} assume ~id2~0 >= 0; {64438#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:43,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {64438#(<= ~st1~0 0)} assume 0 == ~st2~0; {64439#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {64439#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {64439#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {64439#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {64439#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {64439#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {64439#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {64439#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {64440#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {64441#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:43,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {64442#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {64443#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 14);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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,670 INFO L290 TraceCheckUtils]: 63: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,670 INFO L290 TraceCheckUtils]: 64: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} 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; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,675 INFO L290 TraceCheckUtils]: 77: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,675 INFO L290 TraceCheckUtils]: 78: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,676 INFO L290 TraceCheckUtils]: 80: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,677 INFO L290 TraceCheckUtils]: 83: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,677 INFO L290 TraceCheckUtils]: 84: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,678 INFO L290 TraceCheckUtils]: 85: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:43,678 INFO L290 TraceCheckUtils]: 86: Hoare triple {64444#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {64437#false} is VALID [2022-02-20 19:50:43,678 INFO L290 TraceCheckUtils]: 87: Hoare triple {64437#false} check_#res#1 := check_~tmp~1#1; {64437#false} is VALID [2022-02-20 19:50:43,678 INFO L290 TraceCheckUtils]: 88: Hoare triple {64437#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#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; {64437#false} is VALID [2022-02-20 19:50:43,678 INFO L290 TraceCheckUtils]: 89: Hoare triple {64437#false} assume 0 == assert_~arg#1 % 256; {64437#false} is VALID [2022-02-20 19:50:43,679 INFO L290 TraceCheckUtils]: 90: Hoare triple {64437#false} assume !false; {64437#false} is VALID [2022-02-20 19:50:43,679 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:50:43,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:43,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639982549] [2022-02-20 19:50:43,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639982549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:43,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:43,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:50:43,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309743165] [2022-02-20 19:50:43,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 91 [2022-02-20 19:50:43,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:43,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:50:43,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:43,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:50:43,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:50:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:50:43,742 INFO L87 Difference]: Start difference. First operand 3195 states and 5019 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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)