./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.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 5c8eb0411a0e666031f5e256d7f5bf4c8ae4cc2cba31fba81985613c1fb5f8fa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:49:59,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:49:59,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:49:59,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:49:59,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:49:59,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:49:59,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:49:59,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:49:59,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:49:59,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:49:59,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:49:59,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:49:59,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:49:59,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:49:59,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:49:59,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:49:59,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:49:59,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:49:59,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:49:59,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:49:59,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:49:59,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:49:59,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:49:59,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:49:59,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:49:59,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:49:59,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:49:59,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:49:59,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:49:59,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:49:59,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:49:59,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:49:59,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:49:59,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:49:59,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:49:59,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:49:59,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:49:59,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:49:59,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:49:59,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:49:59,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:49:59,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:49:59,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:49:59,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:49:59,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:49:59,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:49:59,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:49:59,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:49:59,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:49:59,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:49:59,651 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:49:59,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:49:59,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:49:59,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:49:59,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:49:59,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:49:59,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:49:59,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:49:59,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:49:59,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:49:59,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:49:59,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:49:59,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:49:59,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:49:59,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:49:59,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:49:59,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:59,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:49:59,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:49:59,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:49:59,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:49:59,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:49:59,657 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:49:59,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:49:59,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:49:59,657 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 -> 5c8eb0411a0e666031f5e256d7f5bf4c8ae4cc2cba31fba81985613c1fb5f8fa [2022-02-20 19:49:59,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:49:59,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:49:59,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:49:59,857 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:49:59,857 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:49:59,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c [2022-02-20 19:49:59,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09fe81ed6/8e815614d1c044aebf9b087f039df366/FLAGac682700c [2022-02-20 19:50:00,406 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:50:00,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c [2022-02-20 19:50:00,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09fe81ed6/8e815614d1c044aebf9b087f039df366/FLAGac682700c [2022-02-20 19:50:00,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09fe81ed6/8e815614d1c044aebf9b087f039df366 [2022-02-20 19:50:00,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:50:00,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:50:00,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:00,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:50:00,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:50:00,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:00" (1/1) ... [2022-02-20 19:50:00,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503ef27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:00, skipping insertion in model container [2022-02-20 19:50:00,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:00" (1/1) ... [2022-02-20 19:50:00,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:50:00,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:50:01,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c[20426,20439] [2022-02-20 19:50:01,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c[21268,21281] [2022-02-20 19:50:01,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:01,485 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:50:01,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c[20426,20439] [2022-02-20 19:50:01,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c[21268,21281] [2022-02-20 19:50:01,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:01,886 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:50:01,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:01 WrapperNode [2022-02-20 19:50:01,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:01,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:01,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:50:01,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:50:01,893 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:01" (1/1) ... [2022-02-20 19:50:01,955 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:01" (1/1) ... [2022-02-20 19:50:02,402 INFO L137 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5210 [2022-02-20 19:50:02,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:02,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:50:02,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:50:02,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:50:02,413 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:01" (1/1) ... [2022-02-20 19:50:02,414 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:01" (1/1) ... [2022-02-20 19:50:02,471 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:01" (1/1) ... [2022-02-20 19:50:02,471 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:01" (1/1) ... [2022-02-20 19:50:02,603 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:01" (1/1) ... [2022-02-20 19:50:02,632 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:01" (1/1) ... [2022-02-20 19:50:02,672 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:01" (1/1) ... [2022-02-20 19:50:02,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:50:02,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:50:02,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:50:02,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:50:02,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:01" (1/1) ... [2022-02-20 19:50:02,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:50:02,755 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:02,774 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:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:50:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:50:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:50:02,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:50:02,888 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:50:02,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:50:08,956 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:50:08,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:50:08,971 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:50:08,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:08 BoogieIcfgContainer [2022-02-20 19:50:08,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:50:08,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:50:08,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:50:08,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:50:08,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:50:00" (1/3) ... [2022-02-20 19:50:08,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ceba948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:08, skipping insertion in model container [2022-02-20 19:50:08,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:01" (2/3) ... [2022-02-20 19:50:08,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ceba948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:08, skipping insertion in model container [2022-02-20 19:50:08,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:08" (3/3) ... [2022-02-20 19:50:08,980 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label07.c [2022-02-20 19:50:08,985 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:50:08,985 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:50:09,022 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:50:09,028 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:09,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:50:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 19:50:09,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:09,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:09,061 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1917262015, now seen corresponding path program 1 times [2022-02-20 19:50:09,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:09,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338123605] [2022-02-20 19:50:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:09,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {949#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:09,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {949#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:09,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet58#1);havoc main_#t~nondet58#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet56#1, main2_#t~ret57#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {949#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:09,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {949#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet56#1 && main2_#t~nondet56#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet56#1;havoc main2_#t~nondet56#1; {949#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:09,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {949#(<= (+ ~a17~0 124) 0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret53#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {949#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:09,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#(<= (+ ~a17~0 124) 0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {948#false} is VALID [2022-02-20 19:50:09,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 19:50:09,249 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:09,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:09,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338123605] [2022-02-20 19:50:09,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338123605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:09,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:09,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:09,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122762345] [2022-02-20 19:50:09,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 19:50:09,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:09,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:09,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:09,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:09,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:09,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:09,288 INFO L87 Difference]: Start difference. First operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:15,058 INFO L93 Difference]: Finished difference Result 2603 states and 4982 transitions. [2022-02-20 19:50:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 19:50:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4982 transitions. [2022-02-20 19:50:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4982 transitions. [2022-02-20 19:50:15,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4982 transitions. [2022-02-20 19:50:18,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4982 edges. 4982 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:18,739 INFO L225 Difference]: With dead ends: 2603 [2022-02-20 19:50:18,739 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:50:18,745 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:18,747 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1031 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:18,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 744 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:50:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:50:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:50:18,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:18,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6177012907191148) internal successors, (2632), 1628 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,843 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6177012907191148) internal successors, (2632), 1628 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,845 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6177012907191148) internal successors, (2632), 1628 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:18,929 INFO L93 Difference]: Finished difference Result 1629 states and 2632 transitions. [2022-02-20 19:50:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2632 transitions. [2022-02-20 19:50:18,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:18,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:18,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.6177012907191148) internal successors, (2632), 1628 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1629 states. [2022-02-20 19:50:18,940 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.6177012907191148) internal successors, (2632), 1628 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1629 states. [2022-02-20 19:50:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:19,024 INFO L93 Difference]: Finished difference Result 1629 states and 2632 transitions. [2022-02-20 19:50:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2632 transitions. [2022-02-20 19:50:19,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:19,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:19,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:19,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.6177012907191148) internal successors, (2632), 1628 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have 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:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2632 transitions. [2022-02-20 19:50:19,114 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2632 transitions. Word has length 7 [2022-02-20 19:50:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:19,114 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2632 transitions. [2022-02-20 19:50:19,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2632 transitions. [2022-02-20 19:50:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:19,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:19,115 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:19,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:50:19,116 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 325703937, now seen corresponding path program 1 times [2022-02-20 19:50:19,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:19,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877928594] [2022-02-20 19:50:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:19,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {8504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8504#true} is VALID [2022-02-20 19:50:19,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {8504#true} is VALID [2022-02-20 19:50:19,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {8504#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8504#true} is VALID [2022-02-20 19:50:19,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {8504#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8506#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:50:19,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {8506#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8507#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:50:19,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {8507#(= |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; {8508#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:50:19,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {8508#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8505#false} is VALID [2022-02-20 19:50:19,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {8505#false} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8505#false} is VALID [2022-02-20 19:50:19,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {8505#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8505#false} is VALID [2022-02-20 19:50:19,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {8505#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8505#false} is VALID [2022-02-20 19:50:19,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {8505#false} ~mode1~0 := 0; {8505#false} is VALID [2022-02-20 19:50:19,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {8505#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8505#false} is VALID [2022-02-20 19:50:19,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {8505#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8505#false} is VALID [2022-02-20 19:50:19,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {8505#false} ~mode2~0 := 0; {8505#false} is VALID [2022-02-20 19:50:19,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {8505#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8505#false} is VALID [2022-02-20 19:50:19,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {8505#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8505#false} is VALID [2022-02-20 19:50:19,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {8505#false} ~mode3~0 := 0; {8505#false} is VALID [2022-02-20 19:50:19,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {8505#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8505#false} is VALID [2022-02-20 19:50:19,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {8505#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8505#false} is VALID [2022-02-20 19:50:19,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {8505#false} ~mode4~0 := 0; {8505#false} is VALID [2022-02-20 19:50:19,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {8505#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8505#false} is VALID [2022-02-20 19:50:19,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {8505#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8505#false} is VALID [2022-02-20 19:50:19,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {8505#false} ~mode5~0 := 0; {8505#false} is VALID [2022-02-20 19:50:19,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {8505#false} assume !(0 != ~mode6~0 % 256); {8505#false} is VALID [2022-02-20 19:50:19,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {8505#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {8505#false} is VALID [2022-02-20 19:50:19,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {8505#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {8505#false} is VALID [2022-02-20 19:50:19,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {8505#false} assume !(0 != ~mode7~0 % 256); {8505#false} is VALID [2022-02-20 19:50:19,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {8505#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {8505#false} is VALID [2022-02-20 19:50:19,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {8505#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {8505#false} is VALID [2022-02-20 19:50:19,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {8505#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {8505#false} is VALID [2022-02-20 19:50:19,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {8505#false} check_#res#1 := check_~tmp~1#1; {8505#false} is VALID [2022-02-20 19:50:19,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {8505#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; {8505#false} is VALID [2022-02-20 19:50:19,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {8505#false} assume 0 == assert_~arg#1 % 256; {8505#false} is VALID [2022-02-20 19:50:19,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {8505#false} assume !false; {8505#false} is VALID [2022-02-20 19:50:19,191 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:19,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:19,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877928594] [2022-02-20 19:50:19,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877928594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:19,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:19,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:50:19,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452450984] [2022-02-20 19:50:19,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:19,193 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:19,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:19,193 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:19,215 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:19,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:50:19,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:50:19,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:50:19,216 INFO L87 Difference]: Start difference. First operand 1629 states and 2632 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:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:23,084 INFO L93 Difference]: Finished difference Result 1701 states and 2744 transitions. [2022-02-20 19:50:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:50:23,084 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:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:23,085 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:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:23,091 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:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:23,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1765 transitions. [2022-02-20 19:50:24,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1765 edges. 1765 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:24,455 INFO L225 Difference]: With dead ends: 1701 [2022-02-20 19:50:24,456 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:50:24,459 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:24,461 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 3 mSDsluCounter, 4900 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6551 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:24,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6551 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:50:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:50:24,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:24,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,494 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,498 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:24,597 INFO L93 Difference]: Finished difference Result 1629 states and 2582 transitions. [2022-02-20 19:50:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2582 transitions. [2022-02-20 19:50:24,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:24,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:24,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1629 states. [2022-02-20 19:50:24,605 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1629 states. [2022-02-20 19:50:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:24,688 INFO L93 Difference]: Finished difference Result 1629 states and 2582 transitions. [2022-02-20 19:50:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2582 transitions. [2022-02-20 19:50:24,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:24,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:24,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:24,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.5869698832206516) internal successors, (2582), 1628 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2582 transitions. [2022-02-20 19:50:24,782 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2582 transitions. Word has length 42 [2022-02-20 19:50:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:24,782 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2582 transitions. [2022-02-20 19:50:24,783 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:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2582 transitions. [2022-02-20 19:50:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 19:50:24,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:24,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:50:24,787 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 996573779, now seen corresponding path program 1 times [2022-02-20 19:50:24,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:24,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100083507] [2022-02-20 19:50:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:24,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {15156#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {15158#(<= ~a2~0 170)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {15158#(<= ~a2~0 170)} assume !(0 != main_#t~nondet58#1);havoc main_#t~nondet58#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet56#1, main2_#t~ret57#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {15158#(<= ~a2~0 170)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet56#1 && main2_#t~nondet56#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet56#1;havoc main2_#t~nondet56#1; {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {15158#(<= ~a2~0 170)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret53#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,965 INFO L290 TraceCheckUtils]: 46: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {15158#(<= ~a2~0 170)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,984 INFO L290 TraceCheckUtils]: 62: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,985 INFO L290 TraceCheckUtils]: 64: Hoare triple {15158#(<= ~a2~0 170)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,985 INFO L290 TraceCheckUtils]: 65: Hoare triple {15158#(<= ~a2~0 170)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {15158#(<= ~a2~0 170)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {15158#(<= ~a2~0 170)} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {15158#(<= ~a2~0 170)} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,987 INFO L290 TraceCheckUtils]: 69: Hoare triple {15158#(<= ~a2~0 170)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,987 INFO L290 TraceCheckUtils]: 70: Hoare triple {15158#(<= ~a2~0 170)} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,987 INFO L290 TraceCheckUtils]: 71: Hoare triple {15158#(<= ~a2~0 170)} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {15158#(<= ~a2~0 170)} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {15158#(<= ~a2~0 170)} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,988 INFO L290 TraceCheckUtils]: 74: Hoare triple {15158#(<= ~a2~0 170)} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {15158#(<= ~a2~0 170)} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {15158#(<= ~a2~0 170)} is VALID [2022-02-20 19:50:24,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {15158#(<= ~a2~0 170)} assume (~a17~0 <= -108 && (189 < ~a2~0 && 281 >= ~a2~0) && ((14 == ~a7~0 || 12 == ~a7~0 || 13 == ~a7~0) && 1 == calculate_output_~input#1) && 15 == ~a24~0) && 5 == ~a5~0;~a17~0 := (if 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) < 0 && 0 != 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) % 109 then 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) % 109 - 109 else 5 * (16 + (if ~a17~0 < 0 && 0 != ~a17~0 % 109 then ~a17~0 % 109 - 109 else ~a17~0 % 109)) % 109) - -2;~a7~0 := 14;~a24~0 := 13;calculate_output_#res#1 := -1; {15157#false} is VALID [2022-02-20 19:50:24,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {15157#false} main2_#t~ret57#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret57#1 && main2_#t~ret57#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret57#1;havoc main2_#t~ret57#1; {15157#false} is VALID [2022-02-20 19:50:24,990 INFO L290 TraceCheckUtils]: 78: Hoare triple {15157#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet56#1 && main2_#t~nondet56#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet56#1;havoc main2_#t~nondet56#1; {15157#false} is VALID [2022-02-20 19:50:24,990 INFO L290 TraceCheckUtils]: 79: Hoare triple {15157#false} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret53#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15157#false} is VALID [2022-02-20 19:50:24,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {15157#false} assume (((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15157#false} is VALID [2022-02-20 19:50:24,990 INFO L290 TraceCheckUtils]: 81: Hoare triple {15157#false} assume !false; {15157#false} is VALID [2022-02-20 19:50:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:24,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:24,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100083507] [2022-02-20 19:50:24,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100083507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:24,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:24,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:24,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351069328] [2022-02-20 19:50:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 19:50:24,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:24,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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:25,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:25,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:25,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:25,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:25,071 INFO L87 Difference]: Start difference. First operand 1629 states and 2582 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:31,020 INFO L93 Difference]: Finished difference Result 4637 states and 7414 transitions. [2022-02-20 19:50:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 19:50:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4477 transitions. [2022-02-20 19:50:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4477 transitions. [2022-02-20 19:50:31,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4477 transitions. [2022-02-20 19:50:34,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4477 edges. 4477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:34,562 INFO L225 Difference]: With dead ends: 4637 [2022-02-20 19:50:34,563 INFO L226 Difference]: Without dead ends: 3133 [2022-02-20 19:50:34,567 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:34,571 INFO L933 BasicCegarLoop]: 740 mSDtfsCounter, 1079 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:34,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1079 Valid, 747 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:50:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-02-20 19:50:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3131. [2022-02-20 19:50:34,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:34,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3133 states. Second operand has 3131 states, 3129 states have (on average 1.4550974752317034) internal successors, (4553), 3130 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:34,664 INFO L74 IsIncluded]: Start isIncluded. First operand 3133 states. Second operand has 3131 states, 3129 states have (on average 1.4550974752317034) internal successors, (4553), 3130 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:34,668 INFO L87 Difference]: Start difference. First operand 3133 states. Second operand has 3131 states, 3129 states have (on average 1.4550974752317034) internal successors, (4553), 3130 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:34,970 INFO L93 Difference]: Finished difference Result 3133 states and 4554 transitions. [2022-02-20 19:50:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4554 transitions. [2022-02-20 19:50:34,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:34,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:34,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 3131 states, 3129 states have (on average 1.4550974752317034) internal successors, (4553), 3130 states have internal predecessors, (4553), 0 states have call successors, (0), 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 3133 states. [2022-02-20 19:50:34,982 INFO L87 Difference]: Start difference. First operand has 3131 states, 3129 states have (on average 1.4550974752317034) internal successors, (4553), 3130 states have internal predecessors, (4553), 0 states have call successors, (0), 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 3133 states. [2022-02-20 19:50:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:35,294 INFO L93 Difference]: Finished difference Result 3133 states and 4554 transitions. [2022-02-20 19:50:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4554 transitions. [2022-02-20 19:50:35,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:35,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:35,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:35,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3129 states have (on average 1.4550974752317034) internal successors, (4553), 3130 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have 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,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 4553 transitions. [2022-02-20 19:50:35,685 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 4553 transitions. Word has length 82 [2022-02-20 19:50:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:35,685 INFO L470 AbstractCegarLoop]: Abstraction has 3131 states and 4553 transitions. [2022-02-20 19:50:35,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have 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,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 4553 transitions. [2022-02-20 19:50:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:35,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:35,687 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:35,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:50:35,687 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1207745120, now seen corresponding path program 1 times [2022-02-20 19:50:35,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:35,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429612311] [2022-02-20 19:50:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:35,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {29267#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29267#true} is VALID [2022-02-20 19:50:35,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {29267#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {29267#true} is VALID [2022-02-20 19:50:35,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {29267#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29267#true} is VALID [2022-02-20 19:50:35,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {29267#true} assume 0 == ~r1~0; {29267#true} is VALID [2022-02-20 19:50:35,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {29267#true} assume ~id1~0 >= 0; {29267#true} is VALID [2022-02-20 19:50:35,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {29267#true} assume 0 == ~st1~0; {29267#true} is VALID [2022-02-20 19:50:35,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {29267#true} assume ~send1~0 == ~id1~0; {29267#true} is VALID [2022-02-20 19:50:35,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {29267#true} assume 0 == ~mode1~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:35,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {29269#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {29268#false} is VALID [2022-02-20 19:50:35,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {29268#false} assume !(node1_~m1~0#1 != ~nomsg~0); {29268#false} is VALID [2022-02-20 19:50:35,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {29268#false} ~mode1~0 := 0; {29268#false} is VALID [2022-02-20 19:50:35,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {29268#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {29268#false} assume !(node2_~m2~0#1 != ~nomsg~0); {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {29268#false} ~mode2~0 := 0; {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {29268#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {29268#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29268#false} is VALID [2022-02-20 19:50:35,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {29268#false} ~mode3~0 := 0; {29268#false} is VALID [2022-02-20 19:50:35,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {29268#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29268#false} is VALID [2022-02-20 19:50:35,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {29268#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29268#false} is VALID [2022-02-20 19:50:35,842 INFO L290 TraceCheckUtils]: 72: Hoare triple {29268#false} ~mode4~0 := 0; {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 74: Hoare triple {29268#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 75: Hoare triple {29268#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 76: Hoare triple {29268#false} ~mode5~0 := 0; {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 77: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 78: Hoare triple {29268#false} assume !(0 != ~mode6~0 % 256); {29268#false} is VALID [2022-02-20 19:50:35,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {29268#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {29268#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {29268#false} assume !(0 != ~mode7~0 % 256); {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {29268#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 84: Hoare triple {29268#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {29268#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29268#false} is VALID [2022-02-20 19:50:35,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {29268#false} check_#res#1 := check_~tmp~1#1; {29268#false} is VALID [2022-02-20 19:50:35,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {29268#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; {29268#false} is VALID [2022-02-20 19:50:35,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {29268#false} assume 0 == assert_~arg#1 % 256; {29268#false} is VALID [2022-02-20 19:50:35,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {29268#false} assume !false; {29268#false} is VALID [2022-02-20 19:50:35,847 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:35,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:35,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429612311] [2022-02-20 19:50:35,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429612311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:35,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:35,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:35,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210748462] [2022-02-20 19:50:35,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:35,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:35,849 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:35,893 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:35,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:35,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:35,894 INFO L87 Difference]: Start difference. First operand 3131 states and 4553 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:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:37,740 INFO L93 Difference]: Finished difference Result 3261 states and 4759 transitions. [2022-02-20 19:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:37,740 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:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:37,741 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:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:37,746 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:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:37,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:38,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:39,149 INFO L225 Difference]: With dead ends: 3261 [2022-02-20 19:50:39,150 INFO L226 Difference]: Without dead ends: 3193 [2022-02-20 19:50:39,151 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:39,151 INFO L933 BasicCegarLoop]: 1697 mSDtfsCounter, 1537 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:39,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1803 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-02-20 19:50:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2022-02-20 19:50:39,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:39,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3193 states. Second operand has 3191 states, 3189 states have (on average 1.4578237692066478) internal successors, (4649), 3190 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have 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:39,235 INFO L74 IsIncluded]: Start isIncluded. First operand 3193 states. Second operand has 3191 states, 3189 states have (on average 1.4578237692066478) internal successors, (4649), 3190 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have 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:39,237 INFO L87 Difference]: Start difference. First operand 3193 states. Second operand has 3191 states, 3189 states have (on average 1.4578237692066478) internal successors, (4649), 3190 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have 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:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:39,522 INFO L93 Difference]: Finished difference Result 3193 states and 4650 transitions. [2022-02-20 19:50:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4650 transitions. [2022-02-20 19:50:39,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:39,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:39,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 3191 states, 3189 states have (on average 1.4578237692066478) internal successors, (4649), 3190 states have internal predecessors, (4649), 0 states have call successors, (0), 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 3193 states. [2022-02-20 19:50:39,546 INFO L87 Difference]: Start difference. First operand has 3191 states, 3189 states have (on average 1.4578237692066478) internal successors, (4649), 3190 states have internal predecessors, (4649), 0 states have call successors, (0), 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 3193 states. [2022-02-20 19:50:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:39,893 INFO L93 Difference]: Finished difference Result 3193 states and 4650 transitions. [2022-02-20 19:50:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4650 transitions. [2022-02-20 19:50:39,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:39,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:39,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:39,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3189 states have (on average 1.4578237692066478) internal successors, (4649), 3190 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4649 transitions. [2022-02-20 19:50:40,280 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4649 transitions. Word has length 91 [2022-02-20 19:50:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:40,280 INFO L470 AbstractCegarLoop]: Abstraction has 3191 states and 4649 transitions. [2022-02-20 19:50:40,281 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:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4649 transitions. [2022-02-20 19:50:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:40,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:40,281 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:40,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:50:40,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1564953708, now seen corresponding path program 1 times [2022-02-20 19:50:40,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:40,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919955316] [2022-02-20 19:50:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:40,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {42202#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {42202#true} is VALID [2022-02-20 19:50:40,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {42202#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {42202#true} is VALID [2022-02-20 19:50:40,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {42202#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {42202#true} is VALID [2022-02-20 19:50:40,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {42202#true} assume 0 == ~r1~0; {42202#true} is VALID [2022-02-20 19:50:40,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {42202#true} assume ~id1~0 >= 0; {42202#true} is VALID [2022-02-20 19:50:40,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {42202#true} assume 0 == ~st1~0; {42202#true} is VALID [2022-02-20 19:50:40,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {42202#true} assume ~send1~0 == ~id1~0; {42202#true} is VALID [2022-02-20 19:50:40,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {42202#true} assume 0 == ~mode1~0 % 256; {42202#true} is VALID [2022-02-20 19:50:40,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {42202#true} assume ~id2~0 >= 0; {42202#true} is VALID [2022-02-20 19:50:40,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {42202#true} assume 0 == ~st2~0; {42202#true} is VALID [2022-02-20 19:50:40,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {42202#true} assume ~send2~0 == ~id2~0; {42202#true} is VALID [2022-02-20 19:50:40,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {42202#true} assume 0 == ~mode2~0 % 256; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,356 INFO L290 TraceCheckUtils]: 47: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {42204#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {42203#false} assume !(node2_~m2~0#1 != ~nomsg~0); {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {42203#false} ~mode2~0 := 0; {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {42203#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {42203#false} assume !(node3_~m3~0#1 != ~nomsg~0); {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {42203#false} ~mode3~0 := 0; {42203#false} is VALID [2022-02-20 19:50:40,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 70: Hoare triple {42203#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 71: Hoare triple {42203#false} assume !(node4_~m4~0#1 != ~nomsg~0); {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 72: Hoare triple {42203#false} ~mode4~0 := 0; {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 73: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {42203#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 75: Hoare triple {42203#false} assume !(node5_~m5~0#1 != ~nomsg~0); {42203#false} is VALID [2022-02-20 19:50:40,363 INFO L290 TraceCheckUtils]: 76: Hoare triple {42203#false} ~mode5~0 := 0; {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {42203#false} assume !(0 != ~mode6~0 % 256); {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {42203#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {42203#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {42203#false} assume !(0 != ~mode7~0 % 256); {42203#false} is VALID [2022-02-20 19:50:40,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {42203#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {42203#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {42203#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {42203#false} check_#res#1 := check_~tmp~1#1; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {42203#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; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 89: Hoare triple {42203#false} assume 0 == assert_~arg#1 % 256; {42203#false} is VALID [2022-02-20 19:50:40,365 INFO L290 TraceCheckUtils]: 90: Hoare triple {42203#false} assume !false; {42203#false} is VALID [2022-02-20 19:50:40,366 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:40,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:40,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919955316] [2022-02-20 19:50:40,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919955316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:40,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:40,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:40,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605614533] [2022-02-20 19:50:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:40,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:40,368 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:40,427 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:40,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:40,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:40,429 INFO L87 Difference]: Start difference. First operand 3191 states and 4649 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:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:42,450 INFO L93 Difference]: Finished difference Result 3435 states and 5037 transitions. [2022-02-20 19:50:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:42,450 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:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:42,451 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:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:42,457 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:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:42,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:43,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:43,930 INFO L225 Difference]: With dead ends: 3435 [2022-02-20 19:50:43,931 INFO L226 Difference]: Without dead ends: 3307 [2022-02-20 19:50:43,932 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:43,933 INFO L933 BasicCegarLoop]: 1692 mSDtfsCounter, 1533 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:43,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1802 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2022-02-20 19:50:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3305. [2022-02-20 19:50:44,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:44,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3307 states. Second operand has 3305 states, 3303 states have (on average 1.4623069936421436) internal successors, (4830), 3304 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have 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:44,015 INFO L74 IsIncluded]: Start isIncluded. First operand 3307 states. Second operand has 3305 states, 3303 states have (on average 1.4623069936421436) internal successors, (4830), 3304 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have 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:44,018 INFO L87 Difference]: Start difference. First operand 3307 states. Second operand has 3305 states, 3303 states have (on average 1.4623069936421436) internal successors, (4830), 3304 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have 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:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:44,343 INFO L93 Difference]: Finished difference Result 3307 states and 4831 transitions. [2022-02-20 19:50:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4831 transitions. [2022-02-20 19:50:44,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:44,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:44,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 3305 states, 3303 states have (on average 1.4623069936421436) internal successors, (4830), 3304 states have internal predecessors, (4830), 0 states have call successors, (0), 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 3307 states. [2022-02-20 19:50:44,351 INFO L87 Difference]: Start difference. First operand has 3305 states, 3303 states have (on average 1.4623069936421436) internal successors, (4830), 3304 states have internal predecessors, (4830), 0 states have call successors, (0), 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 3307 states. [2022-02-20 19:50:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:44,657 INFO L93 Difference]: Finished difference Result 3307 states and 4831 transitions. [2022-02-20 19:50:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4831 transitions. [2022-02-20 19:50:44,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:44,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:44,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:44,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3303 states have (on average 1.4623069936421436) internal successors, (4830), 3304 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have 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,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4830 transitions. [2022-02-20 19:50:45,062 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4830 transitions. Word has length 91 [2022-02-20 19:50:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:45,062 INFO L470 AbstractCegarLoop]: Abstraction has 3305 states and 4830 transitions. [2022-02-20 19:50:45,062 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:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4830 transitions. [2022-02-20 19:50:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:45,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:45,063 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,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:50:45,063 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:45,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1479108296, now seen corresponding path program 1 times [2022-02-20 19:50:45,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:45,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177836118] [2022-02-20 19:50:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:45,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {55703#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {55703#true} is VALID [2022-02-20 19:50:45,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {55703#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {55703#true} is VALID [2022-02-20 19:50:45,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {55703#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {55703#true} assume 0 == ~r1~0; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {55703#true} assume ~id1~0 >= 0; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {55703#true} assume 0 == ~st1~0; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {55703#true} assume ~send1~0 == ~id1~0; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {55703#true} assume 0 == ~mode1~0 % 256; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {55703#true} assume ~id2~0 >= 0; {55703#true} is VALID [2022-02-20 19:50:45,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {55703#true} assume 0 == ~st2~0; {55703#true} is VALID [2022-02-20 19:50:45,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {55703#true} assume ~send2~0 == ~id2~0; {55703#true} is VALID [2022-02-20 19:50:45,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {55703#true} assume 0 == ~mode2~0 % 256; {55703#true} is VALID [2022-02-20 19:50:45,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {55703#true} assume ~id3~0 >= 0; {55703#true} is VALID [2022-02-20 19:50:45,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {55703#true} assume 0 == ~st3~0; {55703#true} is VALID [2022-02-20 19:50:45,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {55703#true} assume ~send3~0 == ~id3~0; {55703#true} is VALID [2022-02-20 19:50:45,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {55703#true} assume 0 == ~mode3~0 % 256; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {55705#(= (+ (* (- 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; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {55705#(= (+ (* (- 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; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {55705#(= (+ (* (- 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; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {55705#(= (+ (* (- 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; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {55705#(= (+ (* (- 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; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {55705#(= (+ (* (- 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; {55705#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 66: Hoare triple {55705#(= (+ (* (- 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; {55704#false} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 67: Hoare triple {55704#false} assume !(node3_~m3~0#1 != ~nomsg~0); {55704#false} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {55704#false} ~mode3~0 := 0; {55704#false} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {55704#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; {55704#false} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {55704#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {55704#false} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {55704#false} assume !(node4_~m4~0#1 != ~nomsg~0); {55704#false} is VALID [2022-02-20 19:50:45,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {55704#false} ~mode4~0 := 0; {55704#false} is VALID [2022-02-20 19:50:45,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {55704#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; {55704#false} is VALID [2022-02-20 19:50:45,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {55704#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {55704#false} is VALID [2022-02-20 19:50:45,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {55704#false} assume !(node5_~m5~0#1 != ~nomsg~0); {55704#false} is VALID [2022-02-20 19:50:45,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {55704#false} ~mode5~0 := 0; {55704#false} is VALID [2022-02-20 19:50:45,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {55704#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; {55704#false} is VALID [2022-02-20 19:50:45,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {55704#false} assume !(0 != ~mode6~0 % 256); {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {55704#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {55704#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {55704#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; {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {55704#false} assume !(0 != ~mode7~0 % 256); {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {55704#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {55704#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {55704#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; {55704#false} is VALID [2022-02-20 19:50:45,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {55704#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {55704#false} is VALID [2022-02-20 19:50:45,142 INFO L290 TraceCheckUtils]: 87: Hoare triple {55704#false} check_#res#1 := check_~tmp~1#1; {55704#false} is VALID [2022-02-20 19:50:45,142 INFO L290 TraceCheckUtils]: 88: Hoare triple {55704#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; {55704#false} is VALID [2022-02-20 19:50:45,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {55704#false} assume 0 == assert_~arg#1 % 256; {55704#false} is VALID [2022-02-20 19:50:45,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {55704#false} assume !false; {55704#false} is VALID [2022-02-20 19:50:45,142 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:45,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:45,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177836118] [2022-02-20 19:50:45,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177836118] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:45,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:45,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:45,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389672538] [2022-02-20 19:50:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:45,144 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:45,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:45,144 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:45,215 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:45,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:45,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:45,216 INFO L87 Difference]: Start difference. First operand 3305 states and 4830 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,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:47,405 INFO L93 Difference]: Finished difference Result 3765 states and 5560 transitions. [2022-02-20 19:50:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:47,406 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,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:47,407 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,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:47,412 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,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:47,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:48,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:49,369 INFO L225 Difference]: With dead ends: 3765 [2022-02-20 19:50:49,369 INFO L226 Difference]: Without dead ends: 3523 [2022-02-20 19:50:49,371 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,371 INFO L933 BasicCegarLoop]: 1687 mSDtfsCounter, 1529 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:49,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1801 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2022-02-20 19:50:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3521. [2022-02-20 19:50:49,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:49,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3523 states. Second operand has 3521 states, 3519 states have (on average 1.4691673770957658) internal successors, (5170), 3520 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have 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,499 INFO L74 IsIncluded]: Start isIncluded. First operand 3523 states. Second operand has 3521 states, 3519 states have (on average 1.4691673770957658) internal successors, (5170), 3520 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have 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,502 INFO L87 Difference]: Start difference. First operand 3523 states. Second operand has 3521 states, 3519 states have (on average 1.4691673770957658) internal successors, (5170), 3520 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have 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,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:49,892 INFO L93 Difference]: Finished difference Result 3523 states and 5171 transitions. [2022-02-20 19:50:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5171 transitions. [2022-02-20 19:50:49,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:49,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:49,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 3521 states, 3519 states have (on average 1.4691673770957658) internal successors, (5170), 3520 states have internal predecessors, (5170), 0 states have call successors, (0), 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 3523 states. [2022-02-20 19:50:49,901 INFO L87 Difference]: Start difference. First operand has 3521 states, 3519 states have (on average 1.4691673770957658) internal successors, (5170), 3520 states have internal predecessors, (5170), 0 states have call successors, (0), 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 3523 states. [2022-02-20 19:50:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:50,264 INFO L93 Difference]: Finished difference Result 3523 states and 5171 transitions. [2022-02-20 19:50:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5171 transitions. [2022-02-20 19:50:50,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:50,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:50,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:50,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3521 states, 3519 states have (on average 1.4691673770957658) internal successors, (5170), 3520 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have 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:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3521 states to 3521 states and 5170 transitions. [2022-02-20 19:50:50,721 INFO L78 Accepts]: Start accepts. Automaton has 3521 states and 5170 transitions. Word has length 91 [2022-02-20 19:50:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:50,722 INFO L470 AbstractCegarLoop]: Abstraction has 3521 states and 5170 transitions. [2022-02-20 19:50:50,722 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:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3521 states and 5170 transitions. [2022-02-20 19:50:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:50,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:50,723 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:50,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:50:50,723 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 733525566, now seen corresponding path program 1 times [2022-02-20 19:50:50,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:50,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782180315] [2022-02-20 19:50:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:50,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {70282#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {70282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {70282#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {70282#true} assume 0 == ~r1~0; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {70282#true} assume ~id1~0 >= 0; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {70282#true} assume 0 == ~st1~0; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {70282#true} assume ~send1~0 == ~id1~0; {70282#true} is VALID [2022-02-20 19:50:50,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {70282#true} assume 0 == ~mode1~0 % 256; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {70282#true} assume ~id2~0 >= 0; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {70282#true} assume 0 == ~st2~0; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {70282#true} assume ~send2~0 == ~id2~0; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {70282#true} assume 0 == ~mode2~0 % 256; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {70282#true} assume ~id3~0 >= 0; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {70282#true} assume 0 == ~st3~0; {70282#true} is VALID [2022-02-20 19:50:50,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {70282#true} assume ~send3~0 == ~id3~0; {70282#true} is VALID [2022-02-20 19:50:50,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {70282#true} assume 0 == ~mode3~0 % 256; {70282#true} is VALID [2022-02-20 19:50:50,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {70282#true} assume ~id4~0 >= 0; {70282#true} is VALID [2022-02-20 19:50:50,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {70282#true} assume 0 == ~st4~0; {70282#true} is VALID [2022-02-20 19:50:50,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {70282#true} assume ~send4~0 == ~id4~0; {70282#true} is VALID [2022-02-20 19:50:50,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {70282#true} assume 0 == ~mode4~0 % 256; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,808 INFO L290 TraceCheckUtils]: 67: Hoare triple {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,808 INFO L290 TraceCheckUtils]: 68: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {70284#(= (+ (* (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; {70284#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:50,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {70284#(= (+ (* (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; {70283#false} is VALID [2022-02-20 19:50:50,809 INFO L290 TraceCheckUtils]: 71: Hoare triple {70283#false} assume !(node4_~m4~0#1 != ~nomsg~0); {70283#false} is VALID [2022-02-20 19:50:50,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {70283#false} ~mode4~0 := 0; {70283#false} is VALID [2022-02-20 19:50:50,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {70283#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; {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 74: Hoare triple {70283#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {70283#false} assume !(node5_~m5~0#1 != ~nomsg~0); {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {70283#false} ~mode5~0 := 0; {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {70283#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; {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {70283#false} assume !(0 != ~mode6~0 % 256); {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 79: Hoare triple {70283#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {70283#false} is VALID [2022-02-20 19:50:50,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {70283#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {70283#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; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 82: Hoare triple {70283#false} assume !(0 != ~mode7~0 % 256); {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 83: Hoare triple {70283#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 84: Hoare triple {70283#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 85: Hoare triple {70283#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; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 86: Hoare triple {70283#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 87: Hoare triple {70283#false} check_#res#1 := check_~tmp~1#1; {70283#false} is VALID [2022-02-20 19:50:50,811 INFO L290 TraceCheckUtils]: 88: Hoare triple {70283#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; {70283#false} is VALID [2022-02-20 19:50:50,812 INFO L290 TraceCheckUtils]: 89: Hoare triple {70283#false} assume 0 == assert_~arg#1 % 256; {70283#false} is VALID [2022-02-20 19:50:50,812 INFO L290 TraceCheckUtils]: 90: Hoare triple {70283#false} assume !false; {70283#false} is VALID [2022-02-20 19:50:50,812 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:50,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:50,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782180315] [2022-02-20 19:50:50,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782180315] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:50,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:50,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:50,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716478534] [2022-02-20 19:50:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:50,814 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:50,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:50,815 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:50,863 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:50,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:50,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:50,864 INFO L87 Difference]: Start difference. First operand 3521 states and 5170 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:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:53,224 INFO L93 Difference]: Finished difference Result 4389 states and 6540 transitions. [2022-02-20 19:50:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:53,225 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,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:53,225 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:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:53,230 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:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:53,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:54,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:55,199 INFO L225 Difference]: With dead ends: 4389 [2022-02-20 19:50:55,200 INFO L226 Difference]: Without dead ends: 3931 [2022-02-20 19:50:55,201 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:55,202 INFO L933 BasicCegarLoop]: 1682 mSDtfsCounter, 1525 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:55,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1525 Valid, 1800 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2022-02-20 19:50:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3929. [2022-02-20 19:50:55,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:55,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3931 states. Second operand has 3929 states, 3927 states have (on average 1.4784823020117137) internal successors, (5806), 3928 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have 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,362 INFO L74 IsIncluded]: Start isIncluded. First operand 3931 states. Second operand has 3929 states, 3927 states have (on average 1.4784823020117137) internal successors, (5806), 3928 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have 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,365 INFO L87 Difference]: Start difference. First operand 3931 states. Second operand has 3929 states, 3927 states have (on average 1.4784823020117137) internal successors, (5806), 3928 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have 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,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:55,796 INFO L93 Difference]: Finished difference Result 3931 states and 5807 transitions. [2022-02-20 19:50:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5807 transitions. [2022-02-20 19:50:55,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:55,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:55,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 3929 states, 3927 states have (on average 1.4784823020117137) internal successors, (5806), 3928 states have internal predecessors, (5806), 0 states have call successors, (0), 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 3931 states. [2022-02-20 19:50:55,805 INFO L87 Difference]: Start difference. First operand has 3929 states, 3927 states have (on average 1.4784823020117137) internal successors, (5806), 3928 states have internal predecessors, (5806), 0 states have call successors, (0), 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 3931 states. [2022-02-20 19:50:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:56,232 INFO L93 Difference]: Finished difference Result 3931 states and 5807 transitions. [2022-02-20 19:50:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5807 transitions. [2022-02-20 19:50:56,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:56,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:56,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:56,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3927 states have (on average 1.4784823020117137) internal successors, (5806), 3928 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have 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,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5806 transitions. [2022-02-20 19:50:56,728 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5806 transitions. Word has length 91 [2022-02-20 19:50:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:56,729 INFO L470 AbstractCegarLoop]: Abstraction has 3929 states and 5806 transitions. [2022-02-20 19:50:56,729 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:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5806 transitions. [2022-02-20 19:50:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:56,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:56,730 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:56,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:50:56,730 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1206505292, now seen corresponding path program 1 times [2022-02-20 19:50:56,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:56,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584239030] [2022-02-20 19:50:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:56,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {86909#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {86909#true} is VALID [2022-02-20 19:50:56,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {86909#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {86909#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {86909#true} assume 0 == ~r1~0; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {86909#true} assume ~id1~0 >= 0; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {86909#true} assume 0 == ~st1~0; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {86909#true} assume ~send1~0 == ~id1~0; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {86909#true} assume 0 == ~mode1~0 % 256; {86909#true} is VALID [2022-02-20 19:50:56,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {86909#true} assume ~id2~0 >= 0; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {86909#true} assume 0 == ~st2~0; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {86909#true} assume ~send2~0 == ~id2~0; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {86909#true} assume 0 == ~mode2~0 % 256; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {86909#true} assume ~id3~0 >= 0; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {86909#true} assume 0 == ~st3~0; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {86909#true} assume ~send3~0 == ~id3~0; {86909#true} is VALID [2022-02-20 19:50:56,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {86909#true} assume 0 == ~mode3~0 % 256; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {86909#true} assume ~id4~0 >= 0; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {86909#true} assume 0 == ~st4~0; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {86909#true} assume ~send4~0 == ~id4~0; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {86909#true} assume 0 == ~mode4~0 % 256; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {86909#true} assume ~id5~0 >= 0; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {86909#true} assume 0 == ~st5~0; {86909#true} is VALID [2022-02-20 19:50:56,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {86909#true} assume ~send5~0 == ~id5~0; {86909#true} is VALID [2022-02-20 19:50:56,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {86909#true} assume 0 == ~mode5~0 % 256; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,790 INFO L290 TraceCheckUtils]: 49: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,797 INFO L290 TraceCheckUtils]: 68: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,798 INFO L290 TraceCheckUtils]: 69: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {86911#(= (+ (* (- 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; {86911#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 74: Hoare triple {86911#(= (+ (* (- 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; {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 75: Hoare triple {86910#false} assume !(node5_~m5~0#1 != ~nomsg~0); {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 76: Hoare triple {86910#false} ~mode5~0 := 0; {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 77: Hoare triple {86910#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; {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 78: Hoare triple {86910#false} assume !(0 != ~mode6~0 % 256); {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {86910#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {86910#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {86910#false} is VALID [2022-02-20 19:50:56,800 INFO L290 TraceCheckUtils]: 81: Hoare triple {86910#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; {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 82: Hoare triple {86910#false} assume !(0 != ~mode7~0 % 256); {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 83: Hoare triple {86910#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 84: Hoare triple {86910#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 85: Hoare triple {86910#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; {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 86: Hoare triple {86910#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 87: Hoare triple {86910#false} check_#res#1 := check_~tmp~1#1; {86910#false} is VALID [2022-02-20 19:50:56,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {86910#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; {86910#false} is VALID [2022-02-20 19:50:56,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {86910#false} assume 0 == assert_~arg#1 % 256; {86910#false} is VALID [2022-02-20 19:50:56,802 INFO L290 TraceCheckUtils]: 90: Hoare triple {86910#false} assume !false; {86910#false} is VALID [2022-02-20 19:50:56,802 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:56,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:56,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584239030] [2022-02-20 19:50:56,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584239030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:56,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:56,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:56,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512118530] [2022-02-20 19:50:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:56,803 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:56,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:56,804 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:56,857 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:56,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:56,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:56,858 INFO L87 Difference]: Start difference. First operand 3929 states and 5806 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,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:59,547 INFO L93 Difference]: Finished difference Result 5565 states and 8368 transitions. [2022-02-20 19:50:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:59,563 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,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:59,564 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,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:59,583 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:59,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:51:00,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:01,457 INFO L225 Difference]: With dead ends: 5565 [2022-02-20 19:51:01,458 INFO L226 Difference]: Without dead ends: 4699 [2022-02-20 19:51:01,459 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:01,461 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:01,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 1799 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2022-02-20 19:51:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4697. [2022-02-20 19:51:01,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:01,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4699 states. Second operand has 4697 states, 4695 states have (on average 1.488817891373802) internal successors, (6990), 4696 states have internal predecessors, (6990), 0 states have call successors, (0), 0 states have 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,833 INFO L74 IsIncluded]: Start isIncluded. First operand 4699 states. Second operand has 4697 states, 4695 states have (on average 1.488817891373802) internal successors, (6990), 4696 states have internal predecessors, (6990), 0 states have call successors, (0), 0 states have 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,836 INFO L87 Difference]: Start difference. First operand 4699 states. Second operand has 4697 states, 4695 states have (on average 1.488817891373802) internal successors, (6990), 4696 states have internal predecessors, (6990), 0 states have call successors, (0), 0 states have 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:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:02,428 INFO L93 Difference]: Finished difference Result 4699 states and 6991 transitions. [2022-02-20 19:51:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6991 transitions. [2022-02-20 19:51:02,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:02,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:02,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 4697 states, 4695 states have (on average 1.488817891373802) internal successors, (6990), 4696 states have internal predecessors, (6990), 0 states have call successors, (0), 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 4699 states. [2022-02-20 19:51:02,440 INFO L87 Difference]: Start difference. First operand has 4697 states, 4695 states have (on average 1.488817891373802) internal successors, (6990), 4696 states have internal predecessors, (6990), 0 states have call successors, (0), 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 4699 states. [2022-02-20 19:51:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:03,030 INFO L93 Difference]: Finished difference Result 4699 states and 6991 transitions. [2022-02-20 19:51:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6991 transitions. [2022-02-20 19:51:03,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:03,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:03,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:03,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4697 states, 4695 states have (on average 1.488817891373802) internal successors, (6990), 4696 states have internal predecessors, (6990), 0 states have call successors, (0), 0 states have 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,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4697 states to 4697 states and 6990 transitions. [2022-02-20 19:51:03,742 INFO L78 Accepts]: Start accepts. Automaton has 4697 states and 6990 transitions. Word has length 91 [2022-02-20 19:51:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:03,742 INFO L470 AbstractCegarLoop]: Abstraction has 4697 states and 6990 transitions. [2022-02-20 19:51:03,743 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:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4697 states and 6990 transitions. [2022-02-20 19:51:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:03,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:03,743 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:03,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:51:03,744 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1494177322, now seen corresponding path program 1 times [2022-02-20 19:51:03,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:03,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460097138] [2022-02-20 19:51:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:03,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {107416#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {107416#true} is VALID [2022-02-20 19:51:03,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {107416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {107416#true} is VALID [2022-02-20 19:51:03,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {107416#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {107416#true} is VALID [2022-02-20 19:51:03,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {107416#true} assume 0 == ~r1~0; {107416#true} is VALID [2022-02-20 19:51:03,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {107416#true} assume ~id1~0 >= 0; {107416#true} is VALID [2022-02-20 19:51:03,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {107416#true} assume 0 == ~st1~0; {107418#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:03,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {107418#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {107418#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:03,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {107418#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {107418#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:03,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {107418#(<= ~st1~0 0)} assume ~id2~0 >= 0; {107418#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:03,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {107418#(<= ~st1~0 0)} assume 0 == ~st2~0; {107419#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {107419#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {107419#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {107419#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {107419#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {107419#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {107419#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {107419#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {107420#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {107421#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:03,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {107422#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {107423#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,909 INFO L290 TraceCheckUtils]: 81: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,909 INFO L290 TraceCheckUtils]: 82: Hoare triple {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,909 INFO L290 TraceCheckUtils]: 83: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,910 INFO L290 TraceCheckUtils]: 84: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,910 INFO L290 TraceCheckUtils]: 85: Hoare triple {107424#(<= (+ ~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; {107424#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:03,910 INFO L290 TraceCheckUtils]: 86: Hoare triple {107424#(<= (+ ~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; {107417#false} is VALID [2022-02-20 19:51:03,910 INFO L290 TraceCheckUtils]: 87: Hoare triple {107417#false} check_#res#1 := check_~tmp~1#1; {107417#false} is VALID [2022-02-20 19:51:03,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {107417#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; {107417#false} is VALID [2022-02-20 19:51:03,911 INFO L290 TraceCheckUtils]: 89: Hoare triple {107417#false} assume 0 == assert_~arg#1 % 256; {107417#false} is VALID [2022-02-20 19:51:03,911 INFO L290 TraceCheckUtils]: 90: Hoare triple {107417#false} assume !false; {107417#false} is VALID [2022-02-20 19:51:03,911 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:03,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:03,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460097138] [2022-02-20 19:51:03,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460097138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:03,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:03,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:51:03,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088066689] [2022-02-20 19:51:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:03,913 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:03,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:03,913 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:03,964 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:03,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:51:03,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:51:03,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:51:03,965 INFO L87 Difference]: Start difference. First operand 4697 states and 6990 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)