./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.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.UNBOUNDED.pals+Problem12_label01.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 b52b7cb04206fcfe3f216083825f85a3c49ed6dc90ac2fa7b25183898e97828e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:50:17,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:50:17,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:50:17,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:50:17,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:50:17,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:50:17,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:50:17,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:50:17,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:50:17,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:50:17,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:50:17,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:50:17,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:50:17,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:50:17,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:50:17,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:50:17,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:50:17,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:50:17,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:50:17,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:50:17,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:50:17,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:50:17,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:50:17,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:50:17,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:50:17,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:50:17,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:50:17,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:50:17,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:50:17,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:50:17,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:50:17,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:50:17,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:50:17,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:50:17,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:50:17,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:50:17,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:50:17,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:50:17,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:50:17,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:50:17,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:50:17,289 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:50:17,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:50:17,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:50:17,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:50:17,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:50:17,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:50:17,316 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:50:17,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:50:17,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:50:17,317 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:50:17,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:50:17,318 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:50:17,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:50:17,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:50:17,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:50:17,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:50:17,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:50:17,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:50:17,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:50:17,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:17,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:50:17,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:50:17,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:50:17,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:50:17,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:50:17,321 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:50:17,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:50:17,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:50:17,322 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 -> b52b7cb04206fcfe3f216083825f85a3c49ed6dc90ac2fa7b25183898e97828e [2022-02-20 19:50:17,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:50:17,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:50:17,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:50:17,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:50:17,533 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:50:17,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:50:17,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650627658/93a3a7e06733409da6ab4c1ea3f887a5/FLAG2bd3f2a3b [2022-02-20 19:50:18,128 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:50:18,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:50:18,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650627658/93a3a7e06733409da6ab4c1ea3f887a5/FLAG2bd3f2a3b [2022-02-20 19:50:18,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650627658/93a3a7e06733409da6ab4c1ea3f887a5 [2022-02-20 19:50:18,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:50:18,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:50:18,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:18,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:50:18,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:50:18,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:18" (1/1) ... [2022-02-20 19:50:18,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224e8e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:18, skipping insertion in model container [2022-02-20 19:50:18,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:18" (1/1) ... [2022-02-20 19:50:18,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:50:18,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:50:18,952 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.UNBOUNDED.pals+Problem12_label01.c[20454,20467] [2022-02-20 19:50:18,986 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.UNBOUNDED.pals+Problem12_label01.c[26009,26022] [2022-02-20 19:50:19,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:19,488 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:50:19,528 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.UNBOUNDED.pals+Problem12_label01.c[20454,20467] [2022-02-20 19:50:19,538 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.UNBOUNDED.pals+Problem12_label01.c[26009,26022] [2022-02-20 19:50:19,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:19,851 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:50:19,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19 WrapperNode [2022-02-20 19:50:19,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:19,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:19,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:50:19,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:50:19,857 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:50:19" (1/1) ... [2022-02-20 19:50:19,898 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:50:19" (1/1) ... [2022-02-20 19:50:20,237 INFO L137 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5208 [2022-02-20 19:50:20,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:20,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:50:20,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:50:20,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:50:20,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:50:20,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:50:20,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:50:20,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:50:20,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (1/1) ... [2022-02-20 19:50:20,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:50:20,568 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:50:20,574 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:50:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:50:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:50:20,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:50:20,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:50:20,766 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:50:20,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:50:27,058 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:50:27,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:50:27,072 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:50:27,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:27 BoogieIcfgContainer [2022-02-20 19:50:27,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:50:27,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:50:27,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:50:27,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:50:27,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:50:18" (1/3) ... [2022-02-20 19:50:27,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71411c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:27, skipping insertion in model container [2022-02-20 19:50:27,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:19" (2/3) ... [2022-02-20 19:50:27,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71411c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:27, skipping insertion in model container [2022-02-20 19:50:27,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:27" (3/3) ... [2022-02-20 19:50:27,081 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:50:27,087 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:50:27,088 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:50:27,125 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:50:27,129 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:27,130 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:50:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 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:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:27,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:27,168 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:27,169 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash -949343158, now seen corresponding path program 1 times [2022-02-20 19:50:27,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:27,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126612245] [2022-02-20 19:50:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:27,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#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(32, 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; {949#true} is VALID [2022-02-20 19:50:27,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {949#true} is VALID [2022-02-20 19:50:27,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {949#true} is VALID [2022-02-20 19:50:27,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {949#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {949#true} is VALID [2022-02-20 19:50:27,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {949#true} init_#res#1 := init_~tmp~0#1; {949#true} is VALID [2022-02-20 19:50:27,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#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; {949#true} is VALID [2022-02-20 19:50:27,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {950#false} is VALID [2022-02-20 19:50:27,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {950#false} assume !false;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; {950#false} is VALID [2022-02-20 19:50:27,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#false} assume !(0 != ~mode1~0 % 256); {950#false} is VALID [2022-02-20 19:50:27,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {950#false} is VALID [2022-02-20 19:50:27,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#false} ~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; {950#false} is VALID [2022-02-20 19:50:27,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#false} assume !(0 != ~mode2~0 % 256); {950#false} is VALID [2022-02-20 19:50:27,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {950#false} is VALID [2022-02-20 19:50:27,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#false} ~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; {950#false} is VALID [2022-02-20 19:50:27,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {950#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {950#false} is VALID [2022-02-20 19:50:27,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {950#false} assume !(node3_~m3~0#1 != ~nomsg~0); {950#false} is VALID [2022-02-20 19:50:27,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {950#false} ~mode3~0 := 0; {950#false} is VALID [2022-02-20 19:50:27,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {950#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {950#false} is VALID [2022-02-20 19:50:27,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {950#false} assume !(node4_~m4~0#1 != ~nomsg~0); {950#false} is VALID [2022-02-20 19:50:27,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {950#false} ~mode4~0 := 0; {950#false} is VALID [2022-02-20 19:50:27,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {950#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {950#false} is VALID [2022-02-20 19:50:27,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {950#false} assume !(node5_~m5~0#1 != ~nomsg~0); {950#false} is VALID [2022-02-20 19:50:27,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {950#false} ~mode5~0 := 0; {950#false} is VALID [2022-02-20 19:50:27,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {950#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {950#false} is VALID [2022-02-20 19:50:27,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {950#false} assume !(node6_~m6~0#1 != ~nomsg~0); {950#false} is VALID [2022-02-20 19:50:27,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {950#false} ~mode6~0 := 0; {950#false} is VALID [2022-02-20 19:50:27,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {950#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {950#false} is VALID [2022-02-20 19:50:27,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {950#false} assume !(node7_~m7~0#1 != ~nomsg~0); {950#false} is VALID [2022-02-20 19:50:27,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {950#false} ~mode7~0 := 0; {950#false} is VALID [2022-02-20 19:50:27,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {950#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {950#false} is VALID [2022-02-20 19:50:27,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {950#false} check_#res#1 := check_~tmp~1#1; {950#false} is VALID [2022-02-20 19:50:27,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {950#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; {950#false} is VALID [2022-02-20 19:50:27,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {950#false} assume 0 == assert_~arg#1 % 256; {950#false} is VALID [2022-02-20 19:50:27,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-02-20 19:50:27,450 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:27,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:27,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126612245] [2022-02-20 19:50:27,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126612245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:27,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:27,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:27,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932226800] [2022-02-20 19:50:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:27,459 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:27,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:27,462 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:27,502 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:27,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:50:27,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:50:27,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:50:27,531 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 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:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:28,715 INFO L93 Difference]: Finished difference Result 1834 states and 3468 transitions. [2022-02-20 19:50:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:50:28,715 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:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:28,716 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:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3468 transitions. [2022-02-20 19:50:28,743 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:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3468 transitions. [2022-02-20 19:50:28,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3468 transitions. [2022-02-20 19:50:31,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3468 edges. 3468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:31,270 INFO L225 Difference]: With dead ends: 1834 [2022-02-20 19:50:31,270 INFO L226 Difference]: Without dead ends: 880 [2022-02-20 19:50:31,277 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:31,281 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:31,282 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:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-02-20 19:50:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2022-02-20 19:50:31,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:31,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 880 states. Second operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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:31,357 INFO L74 IsIncluded]: Start isIncluded. First operand 880 states. Second operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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:31,358 INFO L87 Difference]: Start difference. First operand 880 states. Second operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:31,388 INFO L93 Difference]: Finished difference Result 880 states and 1656 transitions. [2022-02-20 19:50:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1656 transitions. [2022-02-20 19:50:31,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:31,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:31,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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 880 states. [2022-02-20 19:50:31,395 INFO L87 Difference]: Start difference. First operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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 880 states. [2022-02-20 19:50:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:31,424 INFO L93 Difference]: Finished difference Result 880 states and 1656 transitions. [2022-02-20 19:50:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1656 transitions. [2022-02-20 19:50:31,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:31,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:31,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:31,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8861047835990887) internal successors, (1656), 879 states have internal predecessors, (1656), 0 states have call successors, (0), 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:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1656 transitions. [2022-02-20 19:50:31,456 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1656 transitions. Word has length 42 [2022-02-20 19:50:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:31,457 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1656 transitions. [2022-02-20 19:50:31,457 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:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1656 transitions. [2022-02-20 19:50:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:31,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:31,458 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:31,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:50:31,458 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1343709944, now seen corresponding path program 1 times [2022-02-20 19:50:31,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:31,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199637533] [2022-02-20 19:50:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:31,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {5477#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(32, 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; {5477#true} is VALID [2022-02-20 19:50:31,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {5477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {5477#true} is VALID [2022-02-20 19:50:31,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {5477#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {5477#true} is VALID [2022-02-20 19:50:31,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {5477#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5479#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:50:31,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {5479#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5480#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:50:31,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#(= |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; {5481#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:50:31,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {5481#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5478#false} is VALID [2022-02-20 19:50:31,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {5478#false} assume !false;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; {5478#false} is VALID [2022-02-20 19:50:31,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {5478#false} assume !(0 != ~mode1~0 % 256); {5478#false} is VALID [2022-02-20 19:50:31,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {5478#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5478#false} is VALID [2022-02-20 19:50:31,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {5478#false} ~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; {5478#false} is VALID [2022-02-20 19:50:31,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {5478#false} assume !(0 != ~mode2~0 % 256); {5478#false} is VALID [2022-02-20 19:50:31,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {5478#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5478#false} is VALID [2022-02-20 19:50:31,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {5478#false} ~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; {5478#false} is VALID [2022-02-20 19:50:31,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {5478#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5478#false} is VALID [2022-02-20 19:50:31,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {5478#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5478#false} is VALID [2022-02-20 19:50:31,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {5478#false} ~mode3~0 := 0; {5478#false} is VALID [2022-02-20 19:50:31,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {5478#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5478#false} is VALID [2022-02-20 19:50:31,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {5478#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5478#false} is VALID [2022-02-20 19:50:31,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {5478#false} ~mode4~0 := 0; {5478#false} is VALID [2022-02-20 19:50:31,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {5478#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5478#false} is VALID [2022-02-20 19:50:31,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {5478#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5478#false} is VALID [2022-02-20 19:50:31,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {5478#false} ~mode5~0 := 0; {5478#false} is VALID [2022-02-20 19:50:31,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {5478#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5478#false} is VALID [2022-02-20 19:50:31,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {5478#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5478#false} is VALID [2022-02-20 19:50:31,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {5478#false} ~mode6~0 := 0; {5478#false} is VALID [2022-02-20 19:50:31,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {5478#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5478#false} is VALID [2022-02-20 19:50:31,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {5478#false} assume !(node7_~m7~0#1 != ~nomsg~0); {5478#false} is VALID [2022-02-20 19:50:31,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {5478#false} ~mode7~0 := 0; {5478#false} is VALID [2022-02-20 19:50:31,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {5478#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {5478#false} is VALID [2022-02-20 19:50:31,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {5478#false} check_#res#1 := check_~tmp~1#1; {5478#false} is VALID [2022-02-20 19:50:31,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {5478#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; {5478#false} is VALID [2022-02-20 19:50:31,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {5478#false} assume 0 == assert_~arg#1 % 256; {5478#false} is VALID [2022-02-20 19:50:31,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {5478#false} assume !false; {5478#false} is VALID [2022-02-20 19:50:31,542 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:31,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:31,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199637533] [2022-02-20 19:50:31,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199637533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:31,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:31,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:50:31,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921349906] [2022-02-20 19:50:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:31,544 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:31,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:31,544 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:31,568 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:31,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:50:31,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:50:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:50:31,569 INFO L87 Difference]: Start difference. First operand 880 states and 1656 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:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:35,516 INFO L93 Difference]: Finished difference Result 954 states and 1771 transitions. [2022-02-20 19:50:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:50:35,516 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:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:35,516 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:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:50:35,542 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:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:50:35,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1771 transitions. [2022-02-20 19:50:36,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1771 edges. 1771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:36,858 INFO L225 Difference]: With dead ends: 954 [2022-02-20 19:50:36,858 INFO L226 Difference]: Without dead ends: 880 [2022-02-20 19:50:36,858 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:36,875 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 3 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6563 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:36,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6563 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:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-02-20 19:50:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2022-02-20 19:50:36,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:36,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 880 states. Second operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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:36,894 INFO L74 IsIncluded]: Start isIncluded. First operand 880 states. Second operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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:36,896 INFO L87 Difference]: Start difference. First operand 880 states. Second operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:36,923 INFO L93 Difference]: Finished difference Result 880 states and 1606 transitions. [2022-02-20 19:50:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1606 transitions. [2022-02-20 19:50:36,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:36,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:36,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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 880 states. [2022-02-20 19:50:36,928 INFO L87 Difference]: Start difference. First operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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 880 states. [2022-02-20 19:50:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:36,955 INFO L93 Difference]: Finished difference Result 880 states and 1606 transitions. [2022-02-20 19:50:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1606 transitions. [2022-02-20 19:50:36,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:36,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:36,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:36,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 879 states have internal predecessors, (1606), 0 states have call successors, (0), 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:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1606 transitions. [2022-02-20 19:50:36,992 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1606 transitions. Word has length 42 [2022-02-20 19:50:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:36,993 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1606 transitions. [2022-02-20 19:50:36,994 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:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1606 transitions. [2022-02-20 19:50:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:50:36,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:36,998 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] [2022-02-20 19:50:36,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:50:36,999 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1956123093, now seen corresponding path program 1 times [2022-02-20 19:50:36,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:37,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681072414] [2022-02-20 19:50:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:37,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {9125#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(32, 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; {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {9127#(<= ~a7~0 13)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {9127#(<= ~a7~0 13)} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {9127#(<= ~a7~0 13)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {9127#(<= ~a7~0 13)} 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~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {9127#(<= ~a7~0 13)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {9127#(<= ~a7~0 13)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {9127#(<= ~a7~0 13)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9127#(<= ~a7~0 13)} is VALID [2022-02-20 19:50:37,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {9127#(<= ~a7~0 13)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {9126#false} is VALID [2022-02-20 19:50:37,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {9126#false} assume !false; {9126#false} is VALID [2022-02-20 19:50:37,135 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:37,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:37,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681072414] [2022-02-20 19:50:37,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681072414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:37,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:37,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:37,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854110095] [2022-02-20 19:50:37,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:50:37,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:37,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:37,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:37,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:37,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:37,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:37,169 INFO L87 Difference]: Start difference. First operand 880 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:42,279 INFO L93 Difference]: Finished difference Result 2384 states and 4479 transitions. [2022-02-20 19:50:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:50:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4479 transitions. [2022-02-20 19:50:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4479 transitions. [2022-02-20 19:50:42,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4479 transitions. [2022-02-20 19:50:45,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4479 edges. 4479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:45,526 INFO L225 Difference]: With dead ends: 2384 [2022-02-20 19:50:45,526 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:50:45,527 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:45,528 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 934 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:45,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 244 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:50:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:50:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:50:45,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:45,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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:45,560 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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:45,563 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:45,643 INFO L93 Difference]: Finished difference Result 1631 states and 2981 transitions. [2022-02-20 19:50:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2981 transitions. [2022-02-20 19:50:45,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:45,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:45,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:50:45,651 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:50:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:45,737 INFO L93 Difference]: Finished difference Result 1631 states and 2981 transitions. [2022-02-20 19:50:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2981 transitions. [2022-02-20 19:50:45,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:45,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:45,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:45,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.8299570288520566) internal successors, (2981), 1630 states have internal predecessors, (2981), 0 states have call successors, (0), 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:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2981 transitions. [2022-02-20 19:50:45,860 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2981 transitions. Word has length 48 [2022-02-20 19:50:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:45,862 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2981 transitions. [2022-02-20 19:50:45,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2981 transitions. [2022-02-20 19:50:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:45,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:45,864 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:45,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:50:45,865 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash -461668761, now seen corresponding path program 1 times [2022-02-20 19:50:45,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:45,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102464300] [2022-02-20 19:50:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:45,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {16454#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(32, 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; {16454#true} is VALID [2022-02-20 19:50:45,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {16454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {16454#true} is VALID [2022-02-20 19:50:45,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {16454#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {16454#true} is VALID [2022-02-20 19:50:45,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {16454#true} assume 0 == ~r1~0 % 256; {16454#true} is VALID [2022-02-20 19:50:45,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {16454#true} assume ~id1~0 >= 0; {16454#true} is VALID [2022-02-20 19:50:45,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {16454#true} assume 0 == ~st1~0; {16454#true} is VALID [2022-02-20 19:50:45,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {16454#true} assume ~send1~0 == ~id1~0; {16454#true} is VALID [2022-02-20 19:50:45,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {16454#true} assume 0 == ~mode1~0 % 256; {16454#true} is VALID [2022-02-20 19:50:45,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {16454#true} assume ~id2~0 >= 0; {16454#true} is VALID [2022-02-20 19:50:45,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {16454#true} assume 0 == ~st2~0; {16454#true} is VALID [2022-02-20 19:50:46,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {16454#true} assume ~send2~0 == ~id2~0; {16454#true} is VALID [2022-02-20 19:50:46,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {16454#true} assume 0 == ~mode2~0 % 256; {16454#true} is VALID [2022-02-20 19:50:46,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {16454#true} assume ~id3~0 >= 0; {16454#true} is VALID [2022-02-20 19:50:46,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {16454#true} assume 0 == ~st3~0; {16454#true} is VALID [2022-02-20 19:50:46,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {16454#true} assume ~send3~0 == ~id3~0; {16454#true} is VALID [2022-02-20 19:50:46,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {16454#true} assume 0 == ~mode3~0 % 256; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {16456#(= (+ (* (- 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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {16456#(= (+ (* (- 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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,030 INFO L290 TraceCheckUtils]: 59: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {16456#(= (+ (* (- 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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {16456#(= (+ (* (- 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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,032 INFO L290 TraceCheckUtils]: 64: Hoare triple {16456#(= (+ (* (- 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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {16456#(= (+ (* (- 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; {16456#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:46,033 INFO L290 TraceCheckUtils]: 66: Hoare triple {16456#(= (+ (* (- 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; {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 67: Hoare triple {16455#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 68: Hoare triple {16455#false} ~mode3~0 := 0; {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 69: Hoare triple {16455#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; {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 70: Hoare triple {16455#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 71: Hoare triple {16455#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {16455#false} ~mode4~0 := 0; {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {16455#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; {16455#false} is VALID [2022-02-20 19:50:46,034 INFO L290 TraceCheckUtils]: 74: Hoare triple {16455#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 75: Hoare triple {16455#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 76: Hoare triple {16455#false} ~mode5~0 := 0; {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#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; {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 78: Hoare triple {16455#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 79: Hoare triple {16455#false} assume !(node6_~m6~0#1 != ~nomsg~0); {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 80: Hoare triple {16455#false} ~mode6~0 := 0; {16455#false} is VALID [2022-02-20 19:50:46,035 INFO L290 TraceCheckUtils]: 81: Hoare triple {16455#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; {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 82: Hoare triple {16455#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#false} assume !(node7_~m7~0#1 != ~nomsg~0); {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#false} ~mode7~0 := 0; {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 85: Hoare triple {16455#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; {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 86: Hoare triple {16455#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 87: Hoare triple {16455#false} check_#res#1 := check_~tmp~1#1; {16455#false} is VALID [2022-02-20 19:50:46,036 INFO L290 TraceCheckUtils]: 88: Hoare triple {16455#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; {16455#false} is VALID [2022-02-20 19:50:46,037 INFO L290 TraceCheckUtils]: 89: Hoare triple {16455#false} assume 0 == assert_~arg#1 % 256; {16455#false} is VALID [2022-02-20 19:50:46,037 INFO L290 TraceCheckUtils]: 90: Hoare triple {16455#false} assume !false; {16455#false} is VALID [2022-02-20 19:50:46,037 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:46,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:46,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102464300] [2022-02-20 19:50:46,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102464300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:46,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:46,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:46,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802133203] [2022-02-20 19:50:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:46,038 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:46,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:46,039 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:46,096 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:46,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:46,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:46,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:46,097 INFO L87 Difference]: Start difference. First operand 1631 states and 2981 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:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:47,763 INFO L93 Difference]: Finished difference Result 1765 states and 3193 transitions. [2022-02-20 19:50:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:47,764 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:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:47,764 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:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:47,771 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:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:47,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:50:49,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:49,247 INFO L225 Difference]: With dead ends: 1765 [2022-02-20 19:50:49,247 INFO L226 Difference]: Without dead ends: 1695 [2022-02-20 19:50:49,248 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:49,249 INFO L933 BasicCegarLoop]: 1674 mSDtfsCounter, 1532 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1791 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:49,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 1791 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:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-02-20 19:50:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2022-02-20 19:50:49,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:49,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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:49,284 INFO L74 IsIncluded]: Start isIncluded. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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:49,286 INFO L87 Difference]: Start difference. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:49,374 INFO L93 Difference]: Finished difference Result 1695 states and 3081 transitions. [2022-02-20 19:50:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3081 transitions. [2022-02-20 19:50:49,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:49,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:49,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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 1695 states. [2022-02-20 19:50:49,381 INFO L87 Difference]: Start difference. First operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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 1695 states. [2022-02-20 19:50:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:49,466 INFO L93 Difference]: Finished difference Result 1695 states and 3081 transitions. [2022-02-20 19:50:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3081 transitions. [2022-02-20 19:50:49,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:49,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:49,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:49,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.8214074512123004) internal successors, (3080), 1692 states have internal predecessors, (3080), 0 states have call successors, (0), 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:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3080 transitions. [2022-02-20 19:50:49,562 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3080 transitions. Word has length 91 [2022-02-20 19:50:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:49,563 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 3080 transitions. [2022-02-20 19:50:49,563 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:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3080 transitions. [2022-02-20 19:50:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:49,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:49,565 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:49,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:50:49,565 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1207251491, now seen corresponding path program 1 times [2022-02-20 19:50:49,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:49,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151581194] [2022-02-20 19:50:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:49,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {23379#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(32, 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; {23379#true} is VALID [2022-02-20 19:50:49,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {23379#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {23379#true} is VALID [2022-02-20 19:50:49,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {23379#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {23379#true} assume 0 == ~r1~0 % 256; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {23379#true} assume ~id1~0 >= 0; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {23379#true} assume 0 == ~st1~0; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {23379#true} assume ~send1~0 == ~id1~0; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {23379#true} assume 0 == ~mode1~0 % 256; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {23379#true} assume ~id2~0 >= 0; {23379#true} is VALID [2022-02-20 19:50:49,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {23379#true} assume 0 == ~st2~0; {23379#true} is VALID [2022-02-20 19:50:49,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {23379#true} assume ~send2~0 == ~id2~0; {23379#true} is VALID [2022-02-20 19:50:49,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {23379#true} assume 0 == ~mode2~0 % 256; {23379#true} is VALID [2022-02-20 19:50:49,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {23379#true} assume ~id3~0 >= 0; {23379#true} is VALID [2022-02-20 19:50:49,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {23379#true} assume 0 == ~st3~0; {23379#true} is VALID [2022-02-20 19:50:49,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {23379#true} assume ~send3~0 == ~id3~0; {23379#true} is VALID [2022-02-20 19:50:49,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {23379#true} assume 0 == ~mode3~0 % 256; {23379#true} is VALID [2022-02-20 19:50:49,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {23379#true} assume ~id4~0 >= 0; {23379#true} is VALID [2022-02-20 19:50:49,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {23379#true} assume 0 == ~st4~0; {23379#true} is VALID [2022-02-20 19:50:49,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {23379#true} assume ~send4~0 == ~id4~0; {23379#true} is VALID [2022-02-20 19:50:49,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {23379#true} assume 0 == ~mode4~0 % 256; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,683 INFO L290 TraceCheckUtils]: 39: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,691 INFO L290 TraceCheckUtils]: 60: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,694 INFO L290 TraceCheckUtils]: 68: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {23381#(= (+ (* (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; {23381#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:49,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {23381#(= (+ (* (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; {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 71: Hoare triple {23380#false} assume !(node4_~m4~0#1 != ~nomsg~0); {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {23380#false} ~mode4~0 := 0; {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 73: Hoare triple {23380#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; {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 74: Hoare triple {23380#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 75: Hoare triple {23380#false} assume !(node5_~m5~0#1 != ~nomsg~0); {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 76: Hoare triple {23380#false} ~mode5~0 := 0; {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {23380#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; {23380#false} is VALID [2022-02-20 19:50:49,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {23380#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {23380#false} is VALID [2022-02-20 19:50:49,698 INFO L290 TraceCheckUtils]: 79: Hoare triple {23380#false} assume !(node6_~m6~0#1 != ~nomsg~0); {23380#false} is VALID [2022-02-20 19:50:49,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {23380#false} ~mode6~0 := 0; {23380#false} is VALID [2022-02-20 19:50:49,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {23380#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; {23380#false} is VALID [2022-02-20 19:50:49,698 INFO L290 TraceCheckUtils]: 82: Hoare triple {23380#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {23380#false} is VALID [2022-02-20 19:50:49,698 INFO L290 TraceCheckUtils]: 83: Hoare triple {23380#false} assume !(node7_~m7~0#1 != ~nomsg~0); {23380#false} is VALID [2022-02-20 19:50:49,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {23380#false} ~mode7~0 := 0; {23380#false} is VALID [2022-02-20 19:50:49,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {23380#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; {23380#false} is VALID [2022-02-20 19:50:49,699 INFO L290 TraceCheckUtils]: 86: Hoare triple {23380#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {23380#false} is VALID [2022-02-20 19:50:49,699 INFO L290 TraceCheckUtils]: 87: Hoare triple {23380#false} check_#res#1 := check_~tmp~1#1; {23380#false} is VALID [2022-02-20 19:50:49,699 INFO L290 TraceCheckUtils]: 88: Hoare triple {23380#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; {23380#false} is VALID [2022-02-20 19:50:49,700 INFO L290 TraceCheckUtils]: 89: Hoare triple {23380#false} assume 0 == assert_~arg#1 % 256; {23380#false} is VALID [2022-02-20 19:50:49,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {23380#false} assume !false; {23380#false} is VALID [2022-02-20 19:50:49,701 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:49,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:49,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151581194] [2022-02-20 19:50:49,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151581194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:49,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:49,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:49,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821272460] [2022-02-20 19:50:49,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:49,704 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:49,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:49,704 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:49,754 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:49,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:49,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:49,755 INFO L87 Difference]: Start difference. First operand 1693 states and 3080 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:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:51,466 INFO L93 Difference]: Finished difference Result 1945 states and 3480 transitions. [2022-02-20 19:50:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:51,466 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:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:51,467 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:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:51,473 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:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:51,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:50:52,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:52,956 INFO L225 Difference]: With dead ends: 1945 [2022-02-20 19:50:52,956 INFO L226 Difference]: Without dead ends: 1813 [2022-02-20 19:50:52,957 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:52,957 INFO L933 BasicCegarLoop]: 1669 mSDtfsCounter, 1528 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1790 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:52,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1790 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:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-02-20 19:50:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1811. [2022-02-20 19:50:52,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:52,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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:53,000 INFO L74 IsIncluded]: Start isIncluded. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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:53,001 INFO L87 Difference]: Start difference. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:53,095 INFO L93 Difference]: Finished difference Result 1813 states and 3268 transitions. [2022-02-20 19:50:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3268 transitions. [2022-02-20 19:50:53,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:53,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:53,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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 1813 states. [2022-02-20 19:50:53,102 INFO L87 Difference]: Start difference. First operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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 1813 states. [2022-02-20 19:50:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:53,196 INFO L93 Difference]: Finished difference Result 1813 states and 3268 transitions. [2022-02-20 19:50:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3268 transitions. [2022-02-20 19:50:53,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:53,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:53,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:53,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1809 states have (on average 1.8059701492537314) internal successors, (3267), 1810 states have internal predecessors, (3267), 0 states have call successors, (0), 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:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 3267 transitions. [2022-02-20 19:50:53,295 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 3267 transitions. Word has length 91 [2022-02-20 19:50:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:53,296 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 3267 transitions. [2022-02-20 19:50:53,296 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:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3267 transitions. [2022-02-20 19:50:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:53,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:53,296 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:53,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:50:53,297 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1147684947, now seen corresponding path program 1 times [2022-02-20 19:50:53,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:53,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810921173] [2022-02-20 19:50:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:53,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {30888#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(32, 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; {30888#true} is VALID [2022-02-20 19:50:53,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {30888#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {30888#true} assume 0 == ~r1~0 % 256; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {30888#true} assume ~id1~0 >= 0; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {30888#true} assume 0 == ~st1~0; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {30888#true} assume ~send1~0 == ~id1~0; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {30888#true} assume 0 == ~mode1~0 % 256; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {30888#true} assume ~id2~0 >= 0; {30888#true} is VALID [2022-02-20 19:50:53,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {30888#true} assume 0 == ~st2~0; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {30888#true} assume ~send2~0 == ~id2~0; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {30888#true} assume 0 == ~mode2~0 % 256; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {30888#true} assume ~id3~0 >= 0; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {30888#true} assume 0 == ~st3~0; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {30888#true} assume ~send3~0 == ~id3~0; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {30888#true} assume 0 == ~mode3~0 % 256; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {30888#true} assume ~id4~0 >= 0; {30888#true} is VALID [2022-02-20 19:50:53,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {30888#true} assume 0 == ~st4~0; {30888#true} is VALID [2022-02-20 19:50:53,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {30888#true} assume ~send4~0 == ~id4~0; {30888#true} is VALID [2022-02-20 19:50:53,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {30888#true} assume 0 == ~mode4~0 % 256; {30888#true} is VALID [2022-02-20 19:50:53,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {30888#true} assume ~id5~0 >= 0; {30888#true} is VALID [2022-02-20 19:50:53,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {30888#true} assume 0 == ~st5~0; {30888#true} is VALID [2022-02-20 19:50:53,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {30888#true} assume ~send5~0 == ~id5~0; {30888#true} is VALID [2022-02-20 19:50:53,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {30888#true} assume 0 == ~mode5~0 % 256; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,388 INFO L290 TraceCheckUtils]: 65: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,389 INFO L290 TraceCheckUtils]: 68: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {30890#(= (+ (* (- 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; {30890#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {30890#(= (+ (* (- 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; {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {30889#false} assume !(node5_~m5~0#1 != ~nomsg~0); {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {30889#false} ~mode5~0 := 0; {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {30889#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; {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {30889#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 79: Hoare triple {30889#false} assume !(node6_~m6~0#1 != ~nomsg~0); {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {30889#false} ~mode6~0 := 0; {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {30889#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; {30889#false} is VALID [2022-02-20 19:50:53,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {30889#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 83: Hoare triple {30889#false} assume !(node7_~m7~0#1 != ~nomsg~0); {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {30889#false} ~mode7~0 := 0; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {30889#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; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 86: Hoare triple {30889#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 87: Hoare triple {30889#false} check_#res#1 := check_~tmp~1#1; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 88: Hoare triple {30889#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; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {30889#false} assume 0 == assert_~arg#1 % 256; {30889#false} is VALID [2022-02-20 19:50:53,393 INFO L290 TraceCheckUtils]: 90: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-02-20 19:50:53,393 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:53,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:53,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810921173] [2022-02-20 19:50:53,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810921173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:53,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:53,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:53,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397457171] [2022-02-20 19:50:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:53,394 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:53,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:53,395 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:53,446 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:53,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:53,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:53,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:53,447 INFO L87 Difference]: Start difference. First operand 1811 states and 3267 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:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:55,173 INFO L93 Difference]: Finished difference Result 2287 states and 4021 transitions. [2022-02-20 19:50:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:55,174 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:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:55,174 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:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:55,180 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:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:55,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:50:56,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:56,703 INFO L225 Difference]: With dead ends: 2287 [2022-02-20 19:50:56,703 INFO L226 Difference]: Without dead ends: 2037 [2022-02-20 19:50:56,703 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:56,704 INFO L933 BasicCegarLoop]: 1664 mSDtfsCounter, 1524 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 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:56,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 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:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-02-20 19:50:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2035. [2022-02-20 19:50:56,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:56,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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:56,764 INFO L74 IsIncluded]: Start isIncluded. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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:56,766 INFO L87 Difference]: Start difference. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:56,880 INFO L93 Difference]: Finished difference Result 2037 states and 3620 transitions. [2022-02-20 19:50:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3620 transitions. [2022-02-20 19:50:56,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:56,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:56,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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 2037 states. [2022-02-20 19:50:56,887 INFO L87 Difference]: Start difference. First operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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 2037 states. [2022-02-20 19:50:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:56,999 INFO L93 Difference]: Finished difference Result 2037 states and 3620 transitions. [2022-02-20 19:50:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3620 transitions. [2022-02-20 19:50:57,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:57,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:57,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:57,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2033 states have (on average 1.7801278898180029) internal successors, (3619), 2034 states have internal predecessors, (3619), 0 states have call successors, (0), 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:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3619 transitions. [2022-02-20 19:50:57,124 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3619 transitions. Word has length 91 [2022-02-20 19:50:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:57,125 INFO L470 AbstractCegarLoop]: Abstraction has 2035 states and 3619 transitions. [2022-02-20 19:50:57,125 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:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3619 transitions. [2022-02-20 19:50:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:57,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:57,126 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:57,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:50:57,126 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -446599735, now seen corresponding path program 1 times [2022-02-20 19:50:57,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:57,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267495412] [2022-02-20 19:50:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:57,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {39511#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(32, 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; {39511#true} is VALID [2022-02-20 19:50:57,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {39511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {39511#true} is VALID [2022-02-20 19:50:57,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {39511#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {39511#true} is VALID [2022-02-20 19:50:57,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {39511#true} assume 0 == ~r1~0 % 256; {39511#true} is VALID [2022-02-20 19:50:57,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {39511#true} assume ~id1~0 >= 0; {39511#true} is VALID [2022-02-20 19:50:57,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {39511#true} assume 0 == ~st1~0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {39511#true} assume ~send1~0 == ~id1~0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {39511#true} assume 0 == ~mode1~0 % 256; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {39511#true} assume ~id2~0 >= 0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {39511#true} assume 0 == ~st2~0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#true} assume ~send2~0 == ~id2~0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {39511#true} assume 0 == ~mode2~0 % 256; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {39511#true} assume ~id3~0 >= 0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {39511#true} assume 0 == ~st3~0; {39511#true} is VALID [2022-02-20 19:50:57,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {39511#true} assume ~send3~0 == ~id3~0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {39511#true} assume 0 == ~mode3~0 % 256; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {39511#true} assume ~id4~0 >= 0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {39511#true} assume 0 == ~st4~0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {39511#true} assume ~send4~0 == ~id4~0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {39511#true} assume 0 == ~mode4~0 % 256; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {39511#true} assume ~id5~0 >= 0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {39511#true} assume 0 == ~st5~0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {39511#true} assume ~send5~0 == ~id5~0; {39511#true} is VALID [2022-02-20 19:50:57,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {39511#true} assume 0 == ~mode5~0 % 256; {39511#true} is VALID [2022-02-20 19:50:57,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {39511#true} assume ~id6~0 >= 0; {39511#true} is VALID [2022-02-20 19:50:57,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {39511#true} assume 0 == ~st6~0; {39511#true} is VALID [2022-02-20 19:50:57,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {39511#true} assume ~send6~0 == ~id6~0; {39511#true} is VALID [2022-02-20 19:50:57,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {39511#true} assume 0 == ~mode6~0 % 256; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,198 INFO L290 TraceCheckUtils]: 68: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,200 INFO L290 TraceCheckUtils]: 72: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {39513#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {39512#false} assume !(node6_~m6~0#1 != ~nomsg~0); {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 80: Hoare triple {39512#false} ~mode6~0 := 0; {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 81: Hoare triple {39512#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; {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {39512#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {39512#false} assume !(node7_~m7~0#1 != ~nomsg~0); {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {39512#false} ~mode7~0 := 0; {39512#false} is VALID [2022-02-20 19:50:57,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {39512#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; {39512#false} is VALID [2022-02-20 19:50:57,203 INFO L290 TraceCheckUtils]: 86: Hoare triple {39512#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {39512#false} is VALID [2022-02-20 19:50:57,203 INFO L290 TraceCheckUtils]: 87: Hoare triple {39512#false} check_#res#1 := check_~tmp~1#1; {39512#false} is VALID [2022-02-20 19:50:57,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {39512#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; {39512#false} is VALID [2022-02-20 19:50:57,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {39512#false} assume 0 == assert_~arg#1 % 256; {39512#false} is VALID [2022-02-20 19:50:57,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {39512#false} assume !false; {39512#false} is VALID [2022-02-20 19:50:57,203 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:57,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:57,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267495412] [2022-02-20 19:50:57,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267495412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:57,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:57,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:57,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293538426] [2022-02-20 19:50:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:57,205 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:57,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:57,205 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:57,255 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:57,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:57,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:57,256 INFO L87 Difference]: Start difference. First operand 2035 states and 3619 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:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:59,176 INFO L93 Difference]: Finished difference Result 2935 states and 5037 transitions. [2022-02-20 19:50:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:59,176 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:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:59,177 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:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:59,182 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:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:50:59,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:00,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:00,744 INFO L225 Difference]: With dead ends: 2935 [2022-02-20 19:51:00,744 INFO L226 Difference]: Without dead ends: 2461 [2022-02-20 19:51:00,745 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:51:00,745 INFO L933 BasicCegarLoop]: 1659 mSDtfsCounter, 1520 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1788 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:51:00,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 1788 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2022-02-20 19:51:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2459. [2022-02-20 19:51:00,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:00,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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:51:00,847 INFO L74 IsIncluded]: Start isIncluded. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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:51:00,849 INFO L87 Difference]: Start difference. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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:51:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:01,004 INFO L93 Difference]: Finished difference Result 2461 states and 4280 transitions. [2022-02-20 19:51:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4280 transitions. [2022-02-20 19:51:01,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:01,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:01,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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 2461 states. [2022-02-20 19:51:01,010 INFO L87 Difference]: Start difference. First operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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 2461 states. [2022-02-20 19:51:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:01,167 INFO L93 Difference]: Finished difference Result 2461 states and 4280 transitions. [2022-02-20 19:51:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4280 transitions. [2022-02-20 19:51:01,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:01,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:01,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:01,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2457 states have (on average 1.7415547415547417) internal successors, (4279), 2458 states have internal predecessors, (4279), 0 states have call successors, (0), 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:51:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4279 transitions. [2022-02-20 19:51:01,363 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4279 transitions. Word has length 91 [2022-02-20 19:51:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:01,363 INFO L470 AbstractCegarLoop]: Abstraction has 2459 states and 4279 transitions. [2022-02-20 19:51:01,363 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:51:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4279 transitions. [2022-02-20 19:51:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:01,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:01,364 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:51:01,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:51:01,364 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash -108806593, now seen corresponding path program 1 times [2022-02-20 19:51:01,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:01,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123874934] [2022-02-20 19:51:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:01,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:01,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {50254#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(32, 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; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {50254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {50254#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {50254#true} assume 0 == ~r1~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {50254#true} assume ~id1~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {50254#true} assume 0 == ~st1~0; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {50254#true} assume ~send1~0 == ~id1~0; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {50254#true} assume 0 == ~mode1~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {50254#true} assume ~id2~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {50254#true} assume 0 == ~st2~0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {50254#true} assume ~send2~0 == ~id2~0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {50254#true} assume 0 == ~mode2~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {50254#true} assume ~id3~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {50254#true} assume 0 == ~st3~0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {50254#true} assume ~send3~0 == ~id3~0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {50254#true} assume 0 == ~mode3~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {50254#true} assume ~id4~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {50254#true} assume 0 == ~st4~0; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {50254#true} assume ~send4~0 == ~id4~0; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {50254#true} assume 0 == ~mode4~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {50254#true} assume ~id5~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {50254#true} assume 0 == ~st5~0; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {50254#true} assume ~send5~0 == ~id5~0; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {50254#true} assume 0 == ~mode5~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {50254#true} assume ~id6~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {50254#true} assume 0 == ~st6~0; {50254#true} is VALID [2022-02-20 19:51:01,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {50254#true} assume ~send6~0 == ~id6~0; {50254#true} is VALID [2022-02-20 19:51:01,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {50254#true} assume 0 == ~mode6~0 % 256; {50254#true} is VALID [2022-02-20 19:51:01,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {50254#true} assume ~id7~0 >= 0; {50254#true} is VALID [2022-02-20 19:51:01,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {50254#true} assume 0 == ~st7~0; {50254#true} is VALID [2022-02-20 19:51:01,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {50254#true} assume ~send7~0 == ~id7~0; {50254#true} is VALID [2022-02-20 19:51:01,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {50254#true} assume 0 == ~mode7~0 % 256; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,429 INFO L290 TraceCheckUtils]: 71: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,429 INFO L290 TraceCheckUtils]: 72: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,429 INFO L290 TraceCheckUtils]: 73: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,430 INFO L290 TraceCheckUtils]: 75: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,431 INFO L290 TraceCheckUtils]: 77: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,431 INFO L290 TraceCheckUtils]: 78: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,432 INFO L290 TraceCheckUtils]: 81: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {50256#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 83: Hoare triple {50255#false} assume !(node7_~m7~0#1 != ~nomsg~0); {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 84: Hoare triple {50255#false} ~mode7~0 := 0; {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {50255#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; {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {50255#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {50255#false} check_#res#1 := check_~tmp~1#1; {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 88: Hoare triple {50255#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; {50255#false} is VALID [2022-02-20 19:51:01,433 INFO L290 TraceCheckUtils]: 89: Hoare triple {50255#false} assume 0 == assert_~arg#1 % 256; {50255#false} is VALID [2022-02-20 19:51:01,434 INFO L290 TraceCheckUtils]: 90: Hoare triple {50255#false} assume !false; {50255#false} is VALID [2022-02-20 19:51:01,434 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:51:01,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:01,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123874934] [2022-02-20 19:51:01,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123874934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:01,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:01,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:01,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016628538] [2022-02-20 19:51:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:01,435 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:51:01,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:01,436 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:51:01,492 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:51:01,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:01,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:01,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:01,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:01,494 INFO L87 Difference]: Start difference. First operand 2459 states and 4279 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:51:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:03,816 INFO L93 Difference]: Finished difference Result 4159 states and 6937 transitions. [2022-02-20 19:51:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:03,816 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:51:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:03,817 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:51:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:03,822 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:51:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:03,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:05,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:05,538 INFO L225 Difference]: With dead ends: 4159 [2022-02-20 19:51:05,538 INFO L226 Difference]: Without dead ends: 3261 [2022-02-20 19:51:05,539 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:51:05,539 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1787 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:51:05,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1516 Valid, 1787 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-02-20 19:51:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3259. [2022-02-20 19:51:05,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:05,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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:51:05,766 INFO L74 IsIncluded]: Start isIncluded. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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:51:05,768 INFO L87 Difference]: Start difference. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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:51:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:06,073 INFO L93 Difference]: Finished difference Result 3261 states and 5512 transitions. [2022-02-20 19:51:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 5512 transitions. [2022-02-20 19:51:06,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:06,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:06,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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 3261 states. [2022-02-20 19:51:06,083 INFO L87 Difference]: Start difference. First operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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 3261 states. [2022-02-20 19:51:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:06,370 INFO L93 Difference]: Finished difference Result 3261 states and 5512 transitions. [2022-02-20 19:51:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 5512 transitions. [2022-02-20 19:51:06,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:06,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:06,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:06,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 3257 states have (on average 1.6920478968375805) internal successors, (5511), 3258 states have internal predecessors, (5511), 0 states have call successors, (0), 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:51:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5511 transitions. [2022-02-20 19:51:06,739 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5511 transitions. Word has length 91 [2022-02-20 19:51:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:06,739 INFO L470 AbstractCegarLoop]: Abstraction has 3259 states and 5511 transitions. [2022-02-20 19:51:06,740 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:51:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5511 transitions. [2022-02-20 19:51:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:06,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:06,740 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:51:06,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:51:06,740 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1109178805, now seen corresponding path program 1 times [2022-02-20 19:51:06,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:06,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980547535] [2022-02-20 19:51:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:06,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {65021#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(32, 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; {65021#true} is VALID [2022-02-20 19:51:06,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {65021#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {65021#true} is VALID [2022-02-20 19:51:06,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {65021#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#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_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~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; {65021#true} is VALID [2022-02-20 19:51:06,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {65021#true} assume 0 == ~r1~0 % 256; {65021#true} is VALID [2022-02-20 19:51:06,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {65021#true} assume ~id1~0 >= 0; {65021#true} is VALID [2022-02-20 19:51:06,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {65021#true} assume 0 == ~st1~0; {65023#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:06,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {65023#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {65023#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:06,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {65023#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {65023#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:06,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {65023#(<= ~st1~0 0)} assume ~id2~0 >= 0; {65023#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:06,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {65023#(<= ~st1~0 0)} assume 0 == ~st2~0; {65024#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {65024#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {65024#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {65024#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {65024#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {65024#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {65024#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {65024#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {65025#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {65026#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:06,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {65027#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {65028#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !false;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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {65029#(<= (+ ~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 := ~send1~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {65029#(<= (+ ~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 := ~send2~0; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,855 INFO L290 TraceCheckUtils]: 79: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,855 INFO L290 TraceCheckUtils]: 80: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {65029#(<= (+ ~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; {65029#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:06,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {65029#(<= (+ ~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; {65022#false} is VALID [2022-02-20 19:51:06,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {65022#false} check_#res#1 := check_~tmp~1#1; {65022#false} is VALID [2022-02-20 19:51:06,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {65022#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; {65022#false} is VALID [2022-02-20 19:51:06,857 INFO L290 TraceCheckUtils]: 89: Hoare triple {65022#false} assume 0 == assert_~arg#1 % 256; {65022#false} is VALID [2022-02-20 19:51:06,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {65022#false} assume !false; {65022#false} is VALID [2022-02-20 19:51:06,858 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:51:06,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:06,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980547535] [2022-02-20 19:51:06,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980547535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:06,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:06,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:51:06,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366588603] [2022-02-20 19:51:06,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:06,859 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:51:06,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:06,860 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:51:06,921 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:51:06,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:51:06,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:51:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:51:06,922 INFO L87 Difference]: Start difference. First operand 3259 states and 5511 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)