./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.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_label08.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 fa5f95a04d6083abdc8e62e4666afd780988fdaed849d97770096c71104c7886 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:50:06,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:50:06,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:50:06,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:50:06,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:50:06,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:50:06,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:50:06,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:50:06,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:50:06,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:50:06,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:50:06,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:50:06,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:50:06,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:50:06,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:50:06,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:50:06,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:50:06,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:50:06,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:50:06,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:50:06,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:50:06,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:50:06,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:50:06,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:50:06,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:50:06,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:50:06,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:50:06,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:50:06,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:50:06,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:50:06,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:50:06,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:50:06,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:50:06,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:50:06,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:50:06,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:50:06,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:50:06,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:50:06,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:50:06,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:50:06,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:50:06,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:50:06,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:50:06,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:50:06,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:50:06,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:50:06,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:50:06,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:50:06,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:50:06,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:50:06,932 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:50:06,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:50:06,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:50:06,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:50:06,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:50:06,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:50:06,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:50:06,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:50:06,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:50:06,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:50:06,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:06,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:50:06,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:50:06,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:50:06,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:50:06,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:50:06,936 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:50:06,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:50:06,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:50:06,936 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 -> fa5f95a04d6083abdc8e62e4666afd780988fdaed849d97770096c71104c7886 [2022-02-20 19:50:07,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:50:07,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:50:07,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:50:07,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:50:07,189 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:50:07,190 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_label08.c [2022-02-20 19:50:07,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010e7a532/0bacddfde0214d2b94fd63fb67ee467c/FLAGe7ddf2e61 [2022-02-20 19:50:07,806 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:50:07,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2022-02-20 19:50:07,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010e7a532/0bacddfde0214d2b94fd63fb67ee467c/FLAGe7ddf2e61 [2022-02-20 19:50:08,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010e7a532/0bacddfde0214d2b94fd63fb67ee467c [2022-02-20 19:50:08,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:50:08,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:50:08,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:08,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:50:08,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:50:08,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:08" (1/1) ... [2022-02-20 19:50:08,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54892d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:08, skipping insertion in model container [2022-02-20 19:50:08,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:08" (1/1) ... [2022-02-20 19:50:08,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:50:08,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:50:08,663 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_label08.c[20426,20439] [2022-02-20 19:50:08,683 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_label08.c[23933,23946] [2022-02-20 19:50:09,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:09,185 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:50:09,225 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_label08.c[20426,20439] [2022-02-20 19:50:09,238 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_label08.c[23933,23946] [2022-02-20 19:50:09,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:09,526 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:50:09,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:09 WrapperNode [2022-02-20 19:50:09,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:09,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:09,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:50:09,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:50:09,532 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:09" (1/1) ... [2022-02-20 19:50:09,574 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:09" (1/1) ... [2022-02-20 19:50:10,022 INFO L137 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5210 [2022-02-20 19:50:10,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:10,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:50:10,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:50:10,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:50:10,042 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:09" (1/1) ... [2022-02-20 19:50:10,042 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:09" (1/1) ... [2022-02-20 19:50:10,093 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:09" (1/1) ... [2022-02-20 19:50:10,093 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:09" (1/1) ... [2022-02-20 19:50:10,275 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:09" (1/1) ... [2022-02-20 19:50:10,304 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:09" (1/1) ... [2022-02-20 19:50:10,318 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:09" (1/1) ... [2022-02-20 19:50:10,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:50:10,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:50:10,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:50:10,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:50:10,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:09" (1/1) ... [2022-02-20 19:50:10,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:50:10,483 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:10,485 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:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:50:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:50:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:50:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:50:10,723 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:50:10,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:50:16,841 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:50:16,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:50:16,853 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:50:16,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:16 BoogieIcfgContainer [2022-02-20 19:50:16,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:50:16,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:50:16,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:50:16,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:50:16,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:50:08" (1/3) ... [2022-02-20 19:50:16,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a04731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:16, skipping insertion in model container [2022-02-20 19:50:16,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:09" (2/3) ... [2022-02-20 19:50:16,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a04731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:16, skipping insertion in model container [2022-02-20 19:50:16,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:16" (3/3) ... [2022-02-20 19:50:16,860 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label08.c [2022-02-20 19:50:16,863 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:50:16,863 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:50:16,974 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:50:16,984 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:16,984 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:50:17,017 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:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:50:17,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:17,023 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] [2022-02-20 19:50:17,023 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:17,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash -553137427, now seen corresponding path program 1 times [2022-02-20 19:50:17,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:17,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015898725] [2022-02-20 19:50:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:17,227 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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {949#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {949#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {949#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {949#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {949#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {949#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {949#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {949#(<= 4 ~a5~0)} is VALID [2022-02-20 19:50:17,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {949#(<= 4 ~a5~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {948#false} is VALID [2022-02-20 19:50:17,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 19:50:17,246 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:17,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:17,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015898725] [2022-02-20 19:50:17,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015898725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:17,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:17,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:17,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935873435] [2022-02-20 19:50:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:17,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:50:17,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:17,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call 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:17,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:17,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:17,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:17,304 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:22,876 INFO L93 Difference]: Finished difference Result 2587 states and 4966 transitions. [2022-02-20 19:50:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:22,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:50:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4966 transitions. [2022-02-20 19:50:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4966 transitions. [2022-02-20 19:50:23,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4966 transitions. [2022-02-20 19:50:26,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4966 edges. 4966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:26,318 INFO L225 Difference]: With dead ends: 2587 [2022-02-20 19:50:26,319 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:50:26,326 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:26,329 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 1085 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:26,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 375 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 19:50:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:50:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:50:26,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:26,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.8389674247080516) internal successors, (2992), 1628 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:26,418 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.8389674247080516) internal successors, (2992), 1628 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:26,420 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.8389674247080516) internal successors, (2992), 1628 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:26,499 INFO L93 Difference]: Finished difference Result 1629 states and 2992 transitions. [2022-02-20 19:50:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2992 transitions. [2022-02-20 19:50:26,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:26,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:26,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.8389674247080516) internal successors, (2992), 1628 states have internal predecessors, (2992), 0 states have call successors, (0), 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:26,513 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.8389674247080516) internal successors, (2992), 1628 states have internal predecessors, (2992), 0 states have call successors, (0), 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:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:26,590 INFO L93 Difference]: Finished difference Result 1629 states and 2992 transitions. [2022-02-20 19:50:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2992 transitions. [2022-02-20 19:50:26,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:26,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:26,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:26,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.8389674247080516) internal successors, (2992), 1628 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2992 transitions. [2022-02-20 19:50:26,680 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2992 transitions. Word has length 30 [2022-02-20 19:50:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:26,686 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2992 transitions. [2022-02-20 19:50:26,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2992 transitions. [2022-02-20 19:50:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:26,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:26,688 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:26,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:50:26,689 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:26,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash 325703937, now seen corresponding path program 1 times [2022-02-20 19:50:26,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:26,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139349491] [2022-02-20 19:50:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:26,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {8488#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; {8488#true} is VALID [2022-02-20 19:50:26,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {8488#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; {8488#true} is VALID [2022-02-20 19:50:26,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {8488#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; {8488#true} is VALID [2022-02-20 19:50:26,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {8488#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8490#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:50:26,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {8490#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8491#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:50:26,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {8491#(= |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; {8492#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:50:26,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {8492#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8489#false} is VALID [2022-02-20 19:50:26,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {8489#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:50:26,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {8489#false} ~mode1~0 := 0; {8489#false} is VALID [2022-02-20 19:50:26,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {8489#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:50:26,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {8489#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:50:26,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {8489#false} ~mode2~0 := 0; {8489#false} is VALID [2022-02-20 19:50:26,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {8489#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:50:26,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {8489#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:50:26,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {8489#false} ~mode3~0 := 0; {8489#false} is VALID [2022-02-20 19:50:26,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {8489#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:50:26,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {8489#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:50:26,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {8489#false} ~mode4~0 := 0; {8489#false} is VALID [2022-02-20 19:50:26,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {8489#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:50:26,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {8489#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:50:26,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {8489#false} ~mode5~0 := 0; {8489#false} is VALID [2022-02-20 19:50:26,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#false} assume !(0 != ~mode6~0 % 256); {8489#false} is VALID [2022-02-20 19:50:26,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {8489#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {8489#false} is VALID [2022-02-20 19:50:26,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {8489#false} assume !(0 != ~mode7~0 % 256); {8489#false} is VALID [2022-02-20 19:50:26,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {8489#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {8489#false} is VALID [2022-02-20 19:50:26,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {8489#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {8489#false} is VALID [2022-02-20 19:50:26,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {8489#false} check_#res#1 := check_~tmp~1#1; {8489#false} is VALID [2022-02-20 19:50:26,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {8489#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; {8489#false} is VALID [2022-02-20 19:50:26,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {8489#false} assume 0 == assert_~arg#1 % 256; {8489#false} is VALID [2022-02-20 19:50:26,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {8489#false} assume !false; {8489#false} is VALID [2022-02-20 19:50:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:26,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:26,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139349491] [2022-02-20 19:50:26,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139349491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:26,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:26,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:50:26,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239008233] [2022-02-20 19:50:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:26,803 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:26,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:26,803 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:26,830 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:26,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:50:26,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:50:26,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:50:26,833 INFO L87 Difference]: Start difference. First operand 1629 states and 2992 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:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:31,023 INFO L93 Difference]: Finished difference Result 1701 states and 3104 transitions. [2022-02-20 19:50:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:50:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:50:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:31,023 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:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:31,030 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:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:31,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1765 transitions. [2022-02-20 19:50:32,417 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:32,504 INFO L225 Difference]: With dead ends: 1701 [2022-02-20 19:50:32,505 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:50:32,505 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:32,506 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:32,506 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:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:50:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:50:32,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:32,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.8082360172095882) internal successors, (2942), 1628 states have internal predecessors, (2942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:32,575 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.8082360172095882) internal successors, (2942), 1628 states have internal predecessors, (2942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:32,577 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.8082360172095882) internal successors, (2942), 1628 states have internal predecessors, (2942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:32,688 INFO L93 Difference]: Finished difference Result 1629 states and 2942 transitions. [2022-02-20 19:50:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2942 transitions. [2022-02-20 19:50:32,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:32,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:32,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.8082360172095882) internal successors, (2942), 1628 states have internal predecessors, (2942), 0 states have call successors, (0), 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:32,696 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.8082360172095882) internal successors, (2942), 1628 states have internal predecessors, (2942), 0 states have call successors, (0), 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:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:32,769 INFO L93 Difference]: Finished difference Result 1629 states and 2942 transitions. [2022-02-20 19:50:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2942 transitions. [2022-02-20 19:50:32,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:32,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:32,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:32,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.8082360172095882) internal successors, (2942), 1628 states have internal predecessors, (2942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2942 transitions. [2022-02-20 19:50:32,848 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2942 transitions. Word has length 42 [2022-02-20 19:50:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:32,848 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2942 transitions. [2022-02-20 19:50:32,848 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:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2942 transitions. [2022-02-20 19:50:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:32,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:32,854 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:32,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:50:32,855 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1207745120, now seen corresponding path program 1 times [2022-02-20 19:50:32,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:32,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32645756] [2022-02-20 19:50:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:32,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {15140#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; {15140#true} is VALID [2022-02-20 19:50:32,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {15140#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; {15140#true} is VALID [2022-02-20 19:50:32,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {15140#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; {15140#true} is VALID [2022-02-20 19:50:32,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {15140#true} assume 0 == ~r1~0; {15140#true} is VALID [2022-02-20 19:50:32,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {15140#true} assume ~id1~0 >= 0; {15140#true} is VALID [2022-02-20 19:50:32,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {15140#true} assume 0 == ~st1~0; {15140#true} is VALID [2022-02-20 19:50:32,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {15140#true} assume ~send1~0 == ~id1~0; {15140#true} is VALID [2022-02-20 19:50:32,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {15140#true} assume 0 == ~mode1~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:32,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {15142#(= (+ (* (- 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; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {15142#(= (+ (* (- 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; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {15142#(= (+ (* (- 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; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:33,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {15142#(= (+ (* (- 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; {15141#false} is VALID [2022-02-20 19:50:33,030 INFO L290 TraceCheckUtils]: 59: Hoare triple {15141#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:33,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {15141#false} ~mode1~0 := 0; {15141#false} is VALID [2022-02-20 19:50:33,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {15141#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 63: Hoare triple {15141#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 64: Hoare triple {15141#false} ~mode2~0 := 0; {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {15141#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 67: Hoare triple {15141#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:33,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {15141#false} ~mode3~0 := 0; {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 69: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 70: Hoare triple {15141#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 71: Hoare triple {15141#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 72: Hoare triple {15141#false} ~mode4~0 := 0; {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 74: Hoare triple {15141#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:33,032 INFO L290 TraceCheckUtils]: 75: Hoare triple {15141#false} assume !(node5_~m5~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 76: Hoare triple {15141#false} ~mode5~0 := 0; {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 77: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {15141#false} assume !(0 != ~mode6~0 % 256); {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 79: Hoare triple {15141#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 80: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 81: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,033 INFO L290 TraceCheckUtils]: 82: Hoare triple {15141#false} assume !(0 != ~mode7~0 % 256); {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 83: Hoare triple {15141#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 84: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 85: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 86: Hoare triple {15141#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 87: Hoare triple {15141#false} check_#res#1 := check_~tmp~1#1; {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 88: Hoare triple {15141#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; {15141#false} is VALID [2022-02-20 19:50:33,034 INFO L290 TraceCheckUtils]: 89: Hoare triple {15141#false} assume 0 == assert_~arg#1 % 256; {15141#false} is VALID [2022-02-20 19:50:33,035 INFO L290 TraceCheckUtils]: 90: Hoare triple {15141#false} assume !false; {15141#false} is VALID [2022-02-20 19:50:33,035 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:33,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:33,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32645756] [2022-02-20 19:50:33,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32645756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:33,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:33,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:33,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17035128] [2022-02-20 19:50:33,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:33,037 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:33,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:33,037 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:33,085 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:33,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:33,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:33,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:33,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:33,087 INFO L87 Difference]: Start difference. First operand 1629 states and 2942 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:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:34,942 INFO L93 Difference]: Finished difference Result 1759 states and 3148 transitions. [2022-02-20 19:50:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:34,943 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:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:34,950 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:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:34,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:36,445 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:36,526 INFO L225 Difference]: With dead ends: 1759 [2022-02-20 19:50:36,527 INFO L226 Difference]: Without dead ends: 1691 [2022-02-20 19:50:36,528 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:36,528 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:36,529 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:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-02-20 19:50:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2022-02-20 19:50:36,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:36,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.8008298755186722) internal successors, (3038), 1688 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:36,572 INFO L74 IsIncluded]: Start isIncluded. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.8008298755186722) internal successors, (3038), 1688 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:36,574 INFO L87 Difference]: Start difference. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.8008298755186722) internal successors, (3038), 1688 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:36,730 INFO L93 Difference]: Finished difference Result 1691 states and 3039 transitions. [2022-02-20 19:50:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 3039 transitions. [2022-02-20 19:50:36,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:36,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:36,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 1689 states, 1687 states have (on average 1.8008298755186722) internal successors, (3038), 1688 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1691 states. [2022-02-20 19:50:36,750 INFO L87 Difference]: Start difference. First operand has 1689 states, 1687 states have (on average 1.8008298755186722) internal successors, (3038), 1688 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1691 states. [2022-02-20 19:50:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:36,887 INFO L93 Difference]: Finished difference Result 1691 states and 3039 transitions. [2022-02-20 19:50:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 3039 transitions. [2022-02-20 19:50:36,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:36,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:36,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:36,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.8008298755186722) internal successors, (3038), 1688 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 3038 transitions. [2022-02-20 19:50:36,970 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 3038 transitions. Word has length 91 [2022-02-20 19:50:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:36,971 INFO L470 AbstractCegarLoop]: Abstraction has 1689 states and 3038 transitions. [2022-02-20 19:50:36,971 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:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 3038 transitions. [2022-02-20 19:50:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:36,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:36,972 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:36,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:50:36,973 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1564953708, now seen corresponding path program 1 times [2022-02-20 19:50:36,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:36,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128252103] [2022-02-20 19:50:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:37,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {22047#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; {22047#true} is VALID [2022-02-20 19:50:37,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {22047#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; {22047#true} is VALID [2022-02-20 19:50:37,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {22047#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; {22047#true} is VALID [2022-02-20 19:50:37,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {22047#true} assume 0 == ~r1~0; {22047#true} is VALID [2022-02-20 19:50:37,075 INFO L290 TraceCheckUtils]: 4: Hoare triple {22047#true} assume ~id1~0 >= 0; {22047#true} is VALID [2022-02-20 19:50:37,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {22047#true} assume 0 == ~st1~0; {22047#true} is VALID [2022-02-20 19:50:37,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {22047#true} assume ~send1~0 == ~id1~0; {22047#true} is VALID [2022-02-20 19:50:37,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {22047#true} assume 0 == ~mode1~0 % 256; {22047#true} is VALID [2022-02-20 19:50:37,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {22047#true} assume ~id2~0 >= 0; {22047#true} is VALID [2022-02-20 19:50:37,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {22047#true} assume 0 == ~st2~0; {22047#true} is VALID [2022-02-20 19:50:37,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {22047#true} assume ~send2~0 == ~id2~0; {22047#true} is VALID [2022-02-20 19:50:37,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {22047#true} assume 0 == ~mode2~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {22049#(= (+ (* (- 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; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {22049#(= (+ (* (- 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; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {22049#(= (+ (* (- 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; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {22049#(= (+ (* (- 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; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {22049#(= (+ (* (- 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; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {22049#(= (+ (* (- 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; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:37,099 INFO L290 TraceCheckUtils]: 62: Hoare triple {22049#(= (+ (* (- 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; {22048#false} is VALID [2022-02-20 19:50:37,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {22048#false} assume !(node2_~m2~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:37,099 INFO L290 TraceCheckUtils]: 64: Hoare triple {22048#false} ~mode2~0 := 0; {22048#false} is VALID [2022-02-20 19:50:37,099 INFO L290 TraceCheckUtils]: 65: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,099 INFO L290 TraceCheckUtils]: 66: Hoare triple {22048#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:37,100 INFO L290 TraceCheckUtils]: 67: Hoare triple {22048#false} assume !(node3_~m3~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:37,100 INFO L290 TraceCheckUtils]: 68: Hoare triple {22048#false} ~mode3~0 := 0; {22048#false} is VALID [2022-02-20 19:50:37,100 INFO L290 TraceCheckUtils]: 69: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {22048#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:37,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {22048#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:37,100 INFO L290 TraceCheckUtils]: 72: Hoare triple {22048#false} ~mode4~0 := 0; {22048#false} is VALID [2022-02-20 19:50:37,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {22048#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:37,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {22048#false} assume !(node5_~m5~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:37,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {22048#false} ~mode5~0 := 0; {22048#false} is VALID [2022-02-20 19:50:37,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {22048#false} assume !(0 != ~mode6~0 % 256); {22048#false} is VALID [2022-02-20 19:50:37,105 INFO L290 TraceCheckUtils]: 79: Hoare triple {22048#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {22048#false} is VALID [2022-02-20 19:50:37,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,105 INFO L290 TraceCheckUtils]: 81: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,105 INFO L290 TraceCheckUtils]: 82: Hoare triple {22048#false} assume !(0 != ~mode7~0 % 256); {22048#false} is VALID [2022-02-20 19:50:37,107 INFO L290 TraceCheckUtils]: 83: Hoare triple {22048#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {22048#false} is VALID [2022-02-20 19:50:37,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,107 INFO L290 TraceCheckUtils]: 86: Hoare triple {22048#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {22048#false} is VALID [2022-02-20 19:50:37,107 INFO L290 TraceCheckUtils]: 87: Hoare triple {22048#false} check_#res#1 := check_~tmp~1#1; {22048#false} is VALID [2022-02-20 19:50:37,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {22048#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; {22048#false} is VALID [2022-02-20 19:50:37,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {22048#false} assume 0 == assert_~arg#1 % 256; {22048#false} is VALID [2022-02-20 19:50:37,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {22048#false} assume !false; {22048#false} is VALID [2022-02-20 19:50:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:37,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:37,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128252103] [2022-02-20 19:50:37,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128252103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:37,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:37,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:37,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835595189] [2022-02-20 19:50:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:37,110 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,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:37,111 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:37,160 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:37,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:37,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:37,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:37,161 INFO L87 Difference]: Start difference. First operand 1689 states and 3038 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:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:38,860 INFO L93 Difference]: Finished difference Result 1933 states and 3426 transitions. [2022-02-20 19:50:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:38,861 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:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:38,868 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:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:38,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:40,310 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:40,405 INFO L225 Difference]: With dead ends: 1933 [2022-02-20 19:50:40,406 INFO L226 Difference]: Without dead ends: 1805 [2022-02-20 19:50:40,409 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:40,417 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:40,418 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:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-02-20 19:50:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2022-02-20 19:50:40,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:40,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.787340366463076) internal successors, (3219), 1802 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call 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,481 INFO L74 IsIncluded]: Start isIncluded. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.787340366463076) internal successors, (3219), 1802 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call 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,482 INFO L87 Difference]: Start difference. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.787340366463076) internal successors, (3219), 1802 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call 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,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:40,564 INFO L93 Difference]: Finished difference Result 1805 states and 3220 transitions. [2022-02-20 19:50:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3220 transitions. [2022-02-20 19:50:40,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:40,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:40,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 1803 states, 1801 states have (on average 1.787340366463076) internal successors, (3219), 1802 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1805 states. [2022-02-20 19:50:40,570 INFO L87 Difference]: Start difference. First operand has 1803 states, 1801 states have (on average 1.787340366463076) internal successors, (3219), 1802 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1805 states. [2022-02-20 19:50:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:40,656 INFO L93 Difference]: Finished difference Result 1805 states and 3220 transitions. [2022-02-20 19:50:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3220 transitions. [2022-02-20 19:50:40,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:40,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:40,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:40,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1801 states have (on average 1.787340366463076) internal successors, (3219), 1802 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call 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,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 3219 transitions. [2022-02-20 19:50:40,745 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 3219 transitions. Word has length 91 [2022-02-20 19:50:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:40,745 INFO L470 AbstractCegarLoop]: Abstraction has 1803 states and 3219 transitions. [2022-02-20 19:50:40,745 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,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3219 transitions. [2022-02-20 19:50:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:40,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:40,747 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,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:50:40,747 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1479108296, now seen corresponding path program 1 times [2022-02-20 19:50:40,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:40,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921092131] [2022-02-20 19:50:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:40,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {29520#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; {29520#true} is VALID [2022-02-20 19:50:40,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {29520#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; {29520#true} is VALID [2022-02-20 19:50:40,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {29520#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; {29520#true} is VALID [2022-02-20 19:50:40,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {29520#true} assume 0 == ~r1~0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {29520#true} assume ~id1~0 >= 0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {29520#true} assume 0 == ~st1~0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {29520#true} assume ~send1~0 == ~id1~0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {29520#true} assume 0 == ~mode1~0 % 256; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {29520#true} assume ~id2~0 >= 0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {29520#true} assume 0 == ~st2~0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {29520#true} assume ~send2~0 == ~id2~0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {29520#true} assume 0 == ~mode2~0 % 256; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {29520#true} assume ~id3~0 >= 0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {29520#true} assume 0 == ~st3~0; {29520#true} is VALID [2022-02-20 19:50:40,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {29520#true} assume ~send3~0 == ~id3~0; {29520#true} is VALID [2022-02-20 19:50:40,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {29520#true} assume 0 == ~mode3~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,909 INFO L290 TraceCheckUtils]: 59: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,909 INFO L290 TraceCheckUtils]: 60: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {29522#(= (+ (* (- 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; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:40,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {29522#(= (+ (* (- 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; {29521#false} is VALID [2022-02-20 19:50:40,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {29521#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29521#false} is VALID [2022-02-20 19:50:40,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {29521#false} ~mode3~0 := 0; {29521#false} is VALID [2022-02-20 19:50:40,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {29521#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {29521#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 72: Hoare triple {29521#false} ~mode4~0 := 0; {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 73: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {29521#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {29521#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29521#false} is VALID [2022-02-20 19:50:40,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {29521#false} ~mode5~0 := 0; {29521#false} is VALID [2022-02-20 19:50:40,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {29521#false} assume !(0 != ~mode6~0 % 256); {29521#false} is VALID [2022-02-20 19:50:40,914 INFO L290 TraceCheckUtils]: 79: Hoare triple {29521#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29521#false} is VALID [2022-02-20 19:50:40,914 INFO L290 TraceCheckUtils]: 80: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,914 INFO L290 TraceCheckUtils]: 81: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,914 INFO L290 TraceCheckUtils]: 82: Hoare triple {29521#false} assume !(0 != ~mode7~0 % 256); {29521#false} is VALID [2022-02-20 19:50:40,915 INFO L290 TraceCheckUtils]: 83: Hoare triple {29521#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {29521#false} is VALID [2022-02-20 19:50:40,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,920 INFO L290 TraceCheckUtils]: 86: Hoare triple {29521#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29521#false} is VALID [2022-02-20 19:50:40,920 INFO L290 TraceCheckUtils]: 87: Hoare triple {29521#false} check_#res#1 := check_~tmp~1#1; {29521#false} is VALID [2022-02-20 19:50:40,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {29521#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; {29521#false} is VALID [2022-02-20 19:50:40,921 INFO L290 TraceCheckUtils]: 89: Hoare triple {29521#false} assume 0 == assert_~arg#1 % 256; {29521#false} is VALID [2022-02-20 19:50:40,921 INFO L290 TraceCheckUtils]: 90: Hoare triple {29521#false} assume !false; {29521#false} is VALID [2022-02-20 19:50:40,921 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,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:40,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921092131] [2022-02-20 19:50:40,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921092131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:40,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:40,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:40,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372630904] [2022-02-20 19:50:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:40,924 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,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:40,926 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,981 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,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:40,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:40,983 INFO L87 Difference]: Start difference. First operand 1803 states and 3219 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,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:42,850 INFO L93 Difference]: Finished difference Result 2263 states and 3949 transitions. [2022-02-20 19:50:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:42,850 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,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:42,851 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,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:42,856 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,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:42,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:44,298 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:44,416 INFO L225 Difference]: With dead ends: 2263 [2022-02-20 19:50:44,416 INFO L226 Difference]: Without dead ends: 2021 [2022-02-20 19:50:44,417 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:44,417 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:44,418 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:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-02-20 19:50:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2019. [2022-02-20 19:50:44,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:44,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.7645017352503718) internal successors, (3559), 2018 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call 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,494 INFO L74 IsIncluded]: Start isIncluded. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.7645017352503718) internal successors, (3559), 2018 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call 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,495 INFO L87 Difference]: Start difference. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.7645017352503718) internal successors, (3559), 2018 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call 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,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:44,606 INFO L93 Difference]: Finished difference Result 2021 states and 3560 transitions. [2022-02-20 19:50:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3560 transitions. [2022-02-20 19:50:44,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:44,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:44,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 2019 states, 2017 states have (on average 1.7645017352503718) internal successors, (3559), 2018 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2021 states. [2022-02-20 19:50:44,612 INFO L87 Difference]: Start difference. First operand has 2019 states, 2017 states have (on average 1.7645017352503718) internal successors, (3559), 2018 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2021 states. [2022-02-20 19:50:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:44,714 INFO L93 Difference]: Finished difference Result 2021 states and 3560 transitions. [2022-02-20 19:50:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3560 transitions. [2022-02-20 19:50:44,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:44,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:44,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:44,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2017 states have (on average 1.7645017352503718) internal successors, (3559), 2018 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call 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,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3559 transitions. [2022-02-20 19:50:44,833 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3559 transitions. Word has length 91 [2022-02-20 19:50:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:44,833 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 3559 transitions. [2022-02-20 19:50:44,834 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:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3559 transitions. [2022-02-20 19:50:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:44,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:44,835 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:44,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:50:44,835 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 733525566, now seen corresponding path program 1 times [2022-02-20 19:50:44,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:44,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167560338] [2022-02-20 19:50:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:44,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {38071#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; {38071#true} is VALID [2022-02-20 19:50:44,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {38071#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; {38071#true} is VALID [2022-02-20 19:50:44,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {38071#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; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {38071#true} assume 0 == ~r1~0; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {38071#true} assume ~id1~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {38071#true} assume 0 == ~st1~0; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {38071#true} assume ~send1~0 == ~id1~0; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {38071#true} assume 0 == ~mode1~0 % 256; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {38071#true} assume ~id2~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:44,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {38071#true} assume 0 == ~st2~0; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {38071#true} assume ~send2~0 == ~id2~0; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {38071#true} assume 0 == ~mode2~0 % 256; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {38071#true} assume ~id3~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {38071#true} assume 0 == ~st3~0; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {38071#true} assume ~send3~0 == ~id3~0; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {38071#true} assume 0 == ~mode3~0 % 256; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {38071#true} assume ~id4~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:44,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {38071#true} assume 0 == ~st4~0; {38071#true} is VALID [2022-02-20 19:50:44,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {38071#true} assume ~send4~0 == ~id4~0; {38071#true} is VALID [2022-02-20 19:50:44,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {38071#true} assume 0 == ~mode4~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,929 INFO L290 TraceCheckUtils]: 69: Hoare triple {38073#(= (+ (* (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; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:44,929 INFO L290 TraceCheckUtils]: 70: Hoare triple {38073#(= (+ (* (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; {38072#false} is VALID [2022-02-20 19:50:44,929 INFO L290 TraceCheckUtils]: 71: Hoare triple {38072#false} assume !(node4_~m4~0#1 != ~nomsg~0); {38072#false} is VALID [2022-02-20 19:50:44,929 INFO L290 TraceCheckUtils]: 72: Hoare triple {38072#false} ~mode4~0 := 0; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 74: Hoare triple {38072#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 75: Hoare triple {38072#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 76: Hoare triple {38072#false} ~mode5~0 := 0; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 77: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {38072#false} assume !(0 != ~mode6~0 % 256); {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 79: Hoare triple {38072#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,930 INFO L290 TraceCheckUtils]: 81: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 82: Hoare triple {38072#false} assume !(0 != ~mode7~0 % 256); {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {38072#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 85: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 86: Hoare triple {38072#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 87: Hoare triple {38072#false} check_#res#1 := check_~tmp~1#1; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {38072#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; {38072#false} is VALID [2022-02-20 19:50:44,931 INFO L290 TraceCheckUtils]: 89: Hoare triple {38072#false} assume 0 == assert_~arg#1 % 256; {38072#false} is VALID [2022-02-20 19:50:44,932 INFO L290 TraceCheckUtils]: 90: Hoare triple {38072#false} assume !false; {38072#false} is VALID [2022-02-20 19:50:44,973 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:44,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:44,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167560338] [2022-02-20 19:50:44,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167560338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:44,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:44,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:44,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821953303] [2022-02-20 19:50:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:44,974 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:44,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:44,974 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,049 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,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:45,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:45,051 INFO L87 Difference]: Start difference. First operand 2019 states and 3559 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:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:46,902 INFO L93 Difference]: Finished difference Result 2887 states and 4929 transitions. [2022-02-20 19:50:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:46,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:46,902 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:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:46,908 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:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:46,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:47,956 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:48,129 INFO L225 Difference]: With dead ends: 2887 [2022-02-20 19:50:48,130 INFO L226 Difference]: Without dead ends: 2429 [2022-02-20 19:50:48,131 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:48,132 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:48,133 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:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-02-20 19:50:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2427. [2022-02-20 19:50:48,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:48,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.729896907216495) internal successors, (4195), 2426 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call 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:48,225 INFO L74 IsIncluded]: Start isIncluded. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.729896907216495) internal successors, (4195), 2426 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call 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:48,227 INFO L87 Difference]: Start difference. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.729896907216495) internal successors, (4195), 2426 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call 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:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:48,372 INFO L93 Difference]: Finished difference Result 2429 states and 4196 transitions. [2022-02-20 19:50:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 4196 transitions. [2022-02-20 19:50:48,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:48,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:48,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 2427 states, 2425 states have (on average 1.729896907216495) internal successors, (4195), 2426 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2429 states. [2022-02-20 19:50:48,379 INFO L87 Difference]: Start difference. First operand has 2427 states, 2425 states have (on average 1.729896907216495) internal successors, (4195), 2426 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2429 states. [2022-02-20 19:50:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:48,527 INFO L93 Difference]: Finished difference Result 2429 states and 4196 transitions. [2022-02-20 19:50:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 4196 transitions. [2022-02-20 19:50:48,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:48,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:48,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:48,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 1.729896907216495) internal successors, (4195), 2426 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call 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:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 4195 transitions. [2022-02-20 19:50:48,689 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 4195 transitions. Word has length 91 [2022-02-20 19:50:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:48,691 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 4195 transitions. [2022-02-20 19:50:48,691 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:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4195 transitions. [2022-02-20 19:50:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:48,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:48,692 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:48,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:50:48,692 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1206505292, now seen corresponding path program 1 times [2022-02-20 19:50:48,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:48,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956469002] [2022-02-20 19:50:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:48,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {48670#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; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {48670#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; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {48670#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; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {48670#true} assume 0 == ~r1~0; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {48670#true} assume ~id1~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {48670#true} assume 0 == ~st1~0; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {48670#true} assume ~send1~0 == ~id1~0; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {48670#true} assume 0 == ~mode1~0 % 256; {48670#true} is VALID [2022-02-20 19:50:48,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {48670#true} assume ~id2~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {48670#true} assume 0 == ~st2~0; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {48670#true} assume ~send2~0 == ~id2~0; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {48670#true} assume 0 == ~mode2~0 % 256; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {48670#true} assume ~id3~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {48670#true} assume 0 == ~st3~0; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {48670#true} assume ~send3~0 == ~id3~0; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {48670#true} assume 0 == ~mode3~0 % 256; {48670#true} is VALID [2022-02-20 19:50:48,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {48670#true} assume ~id4~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:48,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {48670#true} assume 0 == ~st4~0; {48670#true} is VALID [2022-02-20 19:50:48,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {48670#true} assume ~send4~0 == ~id4~0; {48670#true} is VALID [2022-02-20 19:50:48,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {48670#true} assume 0 == ~mode4~0 % 256; {48670#true} is VALID [2022-02-20 19:50:48,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {48670#true} assume ~id5~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:48,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {48670#true} assume 0 == ~st5~0; {48670#true} is VALID [2022-02-20 19:50:48,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {48670#true} assume ~send5~0 == ~id5~0; {48670#true} is VALID [2022-02-20 19:50:48,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {48670#true} assume 0 == ~mode5~0 % 256; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,761 INFO L290 TraceCheckUtils]: 61: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,764 INFO L290 TraceCheckUtils]: 71: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(= (+ (* (- 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; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:48,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {48672#(= (+ (* (- 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; {48671#false} is VALID [2022-02-20 19:50:48,766 INFO L290 TraceCheckUtils]: 75: Hoare triple {48671#false} assume !(node5_~m5~0#1 != ~nomsg~0); {48671#false} is VALID [2022-02-20 19:50:48,766 INFO L290 TraceCheckUtils]: 76: Hoare triple {48671#false} ~mode5~0 := 0; {48671#false} is VALID [2022-02-20 19:50:48,766 INFO L290 TraceCheckUtils]: 77: Hoare triple {48671#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; {48671#false} is VALID [2022-02-20 19:50:48,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {48671#false} assume !(0 != ~mode6~0 % 256); {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 79: Hoare triple {48671#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {48671#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; {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 81: Hoare triple {48671#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; {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 82: Hoare triple {48671#false} assume !(0 != ~mode7~0 % 256); {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 83: Hoare triple {48671#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 84: Hoare triple {48671#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; {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 85: Hoare triple {48671#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; {48671#false} is VALID [2022-02-20 19:50:48,767 INFO L290 TraceCheckUtils]: 86: Hoare triple {48671#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {48671#false} is VALID [2022-02-20 19:50:48,768 INFO L290 TraceCheckUtils]: 87: Hoare triple {48671#false} check_#res#1 := check_~tmp~1#1; {48671#false} is VALID [2022-02-20 19:50:48,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {48671#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; {48671#false} is VALID [2022-02-20 19:50:48,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {48671#false} assume 0 == assert_~arg#1 % 256; {48671#false} is VALID [2022-02-20 19:50:48,768 INFO L290 TraceCheckUtils]: 90: Hoare triple {48671#false} assume !false; {48671#false} is VALID [2022-02-20 19:50:48,768 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:48,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:48,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956469002] [2022-02-20 19:50:48,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956469002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:48,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:48,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:48,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044481540] [2022-02-20 19:50:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:48,770 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:48,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:48,770 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:48,828 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:48,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:48,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:48,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:48,829 INFO L87 Difference]: Start difference. First operand 2427 states and 4195 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:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:50,961 INFO L93 Difference]: Finished difference Result 4063 states and 6757 transitions. [2022-02-20 19:50:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:50,961 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,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:50,962 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:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:50,969 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:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:50,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:52,415 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:52,736 INFO L225 Difference]: With dead ends: 4063 [2022-02-20 19:50:52,736 INFO L226 Difference]: Without dead ends: 3197 [2022-02-20 19:50:52,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:52,765 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:52,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 1799 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2022-02-20 19:50:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3195. [2022-02-20 19:50:52,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:52,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.6846226119636705) internal successors, (5379), 3194 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call 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:52,981 INFO L74 IsIncluded]: Start isIncluded. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.6846226119636705) internal successors, (5379), 3194 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call 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:52,983 INFO L87 Difference]: Start difference. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.6846226119636705) internal successors, (5379), 3194 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call 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,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:53,252 INFO L93 Difference]: Finished difference Result 3197 states and 5380 transitions. [2022-02-20 19:50:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5380 transitions. [2022-02-20 19:50:53,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:53,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:53,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 3195 states, 3193 states have (on average 1.6846226119636705) internal successors, (5379), 3194 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3197 states. [2022-02-20 19:50:53,261 INFO L87 Difference]: Start difference. First operand has 3195 states, 3193 states have (on average 1.6846226119636705) internal successors, (5379), 3194 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3197 states. [2022-02-20 19:50:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:53,531 INFO L93 Difference]: Finished difference Result 3197 states and 5380 transitions. [2022-02-20 19:50:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5380 transitions. [2022-02-20 19:50:53,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:53,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:53,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:53,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3195 states, 3193 states have (on average 1.6846226119636705) internal successors, (5379), 3194 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call 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,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 5379 transitions. [2022-02-20 19:50:53,874 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 5379 transitions. Word has length 91 [2022-02-20 19:50:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:53,874 INFO L470 AbstractCegarLoop]: Abstraction has 3195 states and 5379 transitions. [2022-02-20 19:50:53,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 5379 transitions. [2022-02-20 19:50:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:53,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:53,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:53,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:50:53,875 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1494177322, now seen corresponding path program 1 times [2022-02-20 19:50:53,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:53,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907475468] [2022-02-20 19:50:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:53,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {63149#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; {63149#true} is VALID [2022-02-20 19:50:53,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {63149#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; {63149#true} is VALID [2022-02-20 19:50:53,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {63149#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; {63149#true} is VALID [2022-02-20 19:50:53,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {63149#true} assume 0 == ~r1~0; {63149#true} is VALID [2022-02-20 19:50:53,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {63149#true} assume ~id1~0 >= 0; {63149#true} is VALID [2022-02-20 19:50:53,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {63149#true} assume 0 == ~st1~0; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:53,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {63151#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:53,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {63151#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:53,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {63151#(<= ~st1~0 0)} assume ~id2~0 >= 0; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:53,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {63151#(<= ~st1~0 0)} assume 0 == ~st2~0; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:53,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,997 INFO L290 TraceCheckUtils]: 68: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,997 INFO L290 TraceCheckUtils]: 69: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,997 INFO L290 TraceCheckUtils]: 70: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,998 INFO L290 TraceCheckUtils]: 71: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,998 INFO L290 TraceCheckUtils]: 72: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,998 INFO L290 TraceCheckUtils]: 73: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,999 INFO L290 TraceCheckUtils]: 74: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:53,999 INFO L290 TraceCheckUtils]: 75: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,000 INFO L290 TraceCheckUtils]: 76: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,000 INFO L290 TraceCheckUtils]: 77: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,000 INFO L290 TraceCheckUtils]: 78: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,002 INFO L290 TraceCheckUtils]: 81: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,003 INFO L290 TraceCheckUtils]: 84: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,003 INFO L290 TraceCheckUtils]: 85: Hoare triple {63157#(<= (+ ~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; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:54,003 INFO L290 TraceCheckUtils]: 86: Hoare triple {63157#(<= (+ ~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; {63150#false} is VALID [2022-02-20 19:50:54,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {63150#false} check_#res#1 := check_~tmp~1#1; {63150#false} is VALID [2022-02-20 19:50:54,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {63150#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; {63150#false} is VALID [2022-02-20 19:50:54,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {63150#false} assume 0 == assert_~arg#1 % 256; {63150#false} is VALID [2022-02-20 19:50:54,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {63150#false} assume !false; {63150#false} is VALID [2022-02-20 19:50:54,004 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:54,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:54,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907475468] [2022-02-20 19:50:54,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907475468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:54,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:54,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:50:54,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901788947] [2022-02-20 19:50:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:54,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:54,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:54,121 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:54,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:50:54,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:50:54,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:50:54,122 INFO L87 Difference]: Start difference. First operand 3195 states and 5379 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)