./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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 d26a7b46bddf6c261a466d1462327f17b82fcb8ce3fd85c9d86242e35c98838f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:51:12,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:51:12,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:51:12,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:51:12,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:51:12,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:51:12,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:51:12,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:51:12,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:51:12,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:51:12,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:51:12,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:51:12,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:51:12,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:51:12,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:51:12,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:51:12,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:51:12,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:51:12,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:51:12,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:51:12,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:51:12,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:51:12,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:51:12,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:51:12,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:51:12,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:51:12,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:51:12,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:51:12,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:51:12,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:51:12,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:51:12,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:51:12,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:51:12,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:51:12,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:51:12,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:51:12,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:51:12,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:51:12,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:51:12,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:51:12,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:51:12,576 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:51:12,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:51:12,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:51:12,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:51:12,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:51:12,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:51:12,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:51:12,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:51:12,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:51:12,598 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:51:12,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:51:12,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:51:12,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:51:12,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:51:12,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:51:12,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:51:12,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:51:12,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:51:12,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:51:12,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:51:12,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:51:12,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:51:12,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:51:12,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:51:12,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:51:12,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:51:12,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:51:12,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:51:12,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:51:12,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:51:12,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:51:12,602 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:51:12,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:51:12,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:51:12,602 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 -> d26a7b46bddf6c261a466d1462327f17b82fcb8ce3fd85c9d86242e35c98838f [2022-02-20 19:51:12,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:51:12,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:51:12,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:51:12,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:51:12,824 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:51:12,825 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:51:12,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f107f64d3/de26db8532e34498b52c0cd4faceadd1/FLAG0ddc07d06 [2022-02-20 19:51:13,467 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:51:13,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:51:13,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f107f64d3/de26db8532e34498b52c0cd4faceadd1/FLAG0ddc07d06 [2022-02-20 19:51:13,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f107f64d3/de26db8532e34498b52c0cd4faceadd1 [2022-02-20 19:51:13,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:51:13,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:51:13,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:51:13,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:51:13,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:51:13,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:51:13" (1/1) ... [2022-02-20 19:51:13,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43663a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:13, skipping insertion in model container [2022-02-20 19:51:13,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:51:13" (1/1) ... [2022-02-20 19:51:13,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:51:13,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:51:14,034 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[20528,20541] [2022-02-20 19:51:14,097 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[27818,27831] [2022-02-20 19:51:14,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:51:14,655 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:51:14,690 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[20528,20541] [2022-02-20 19:51:14,697 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_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[27818,27831] [2022-02-20 19:51:14,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:51:14,998 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:51:14,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14 WrapperNode [2022-02-20 19:51:14,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:51:15,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:51:15,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:51:15,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:51:15,005 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:51:14" (1/1) ... [2022-02-20 19:51:15,047 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:51:14" (1/1) ... [2022-02-20 19:51:15,403 INFO L137 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5206 [2022-02-20 19:51:15,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:51:15,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:51:15,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:51:15,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:51:15,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:51:15,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:51:15,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:51:15,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:51:15,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (1/1) ... [2022-02-20 19:51:15,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:51:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:51:15,884 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:51:15,902 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:51:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:51:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:51:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:51:15,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:51:16,044 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:51:16,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:51:23,347 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:51:23,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:51:23,369 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:51:23,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:51:23 BoogieIcfgContainer [2022-02-20 19:51:23,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:51:23,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:51:23,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:51:23,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:51:23,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:51:13" (1/3) ... [2022-02-20 19:51:23,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33408499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:51:23, skipping insertion in model container [2022-02-20 19:51:23,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:51:14" (2/3) ... [2022-02-20 19:51:23,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33408499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:51:23, skipping insertion in model container [2022-02-20 19:51:23,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:51:23" (3/3) ... [2022-02-20 19:51:23,376 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:51:23,380 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:51:23,380 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:51:23,424 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:51:23,433 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:51:23,433 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:51:23,463 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:51:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:51:23,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:23,470 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:51:23,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash 720070723, now seen corresponding path program 1 times [2022-02-20 19:51:23,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:23,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100747902] [2022-02-20 19:51:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:23,626 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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {947#true} is VALID [2022-02-20 19:51:23,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {947#true} is VALID [2022-02-20 19:51:23,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {947#true} is VALID [2022-02-20 19:51:23,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {947#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {947#true} is VALID [2022-02-20 19:51:23,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {947#true} init_#res#1 := init_~tmp~0#1; {947#true} is VALID [2022-02-20 19:51:23,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {947#true} is VALID [2022-02-20 19:51:23,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {947#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {948#false} is VALID [2022-02-20 19:51:23,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {948#false} is VALID [2022-02-20 19:51:23,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {948#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#false} assume !(node1_~m1~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:51:23,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {948#false} ~mode1~0 := 0; {948#false} is VALID [2022-02-20 19:51:23,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {948#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {948#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#false} assume !(node2_~m2~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:51:23,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#false} ~mode2~0 := 0; {948#false} is VALID [2022-02-20 19:51:23,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {948#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {948#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {948#false} assume !(node3_~m3~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:51:23,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#false} ~mode3~0 := 0; {948#false} is VALID [2022-02-20 19:51:23,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {948#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {948#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {948#false} assume !(node4_~m4~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:51:23,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {948#false} ~mode4~0 := 0; {948#false} is VALID [2022-02-20 19:51:23,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {948#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {948#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#false} assume !(node5_~m5~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:51:23,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {948#false} ~mode5~0 := 0; {948#false} is VALID [2022-02-20 19:51:23,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {948#false} assume !(0 != ~mode6~0 % 256); {948#false} is VALID [2022-02-20 19:51:23,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {948#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {948#false} is VALID [2022-02-20 19:51:23,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {948#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {948#false} is VALID [2022-02-20 19:51:23,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {948#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:51:23,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {948#false} assume !(0 != ~mode7~0 % 256); {948#false} is VALID [2022-02-20 19:51:23,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {948#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {948#false} is VALID [2022-02-20 19:51:23,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {948#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {948#false} is VALID [2022-02-20 19:51:23,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {948#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {948#false} is VALID [2022-02-20 19:51:23,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {948#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {948#false} is VALID [2022-02-20 19:51:23,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {948#false} check_#res#1 := check_~tmp~1#1; {948#false} is VALID [2022-02-20 19:51:23,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {948#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {948#false} is VALID [2022-02-20 19:51:23,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {948#false} assume 0 == assert_~arg#1 % 256; {948#false} is VALID [2022-02-20 19:51:23,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 19:51:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:23,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:23,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100747902] [2022-02-20 19:51:23,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100747902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:23,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:23,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:51:23,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667468473] [2022-02-20 19:51:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:51:23,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:23,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,685 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:51:23,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:51:23,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:51:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:51:23,710 INFO L87 Difference]: Start difference. First operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:24,976 INFO L93 Difference]: Finished difference Result 1830 states and 3462 transitions. [2022-02-20 19:51:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:51:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:51:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3462 transitions. [2022-02-20 19:51:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3462 transitions. [2022-02-20 19:51:25,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3462 transitions. [2022-02-20 19:51:27,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3462 edges. 3462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:27,697 INFO L225 Difference]: With dead ends: 1830 [2022-02-20 19:51:27,698 INFO L226 Difference]: Without dead ends: 878 [2022-02-20 19:51:27,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:51:27,708 INFO L933 BasicCegarLoop]: 1717 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:27,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-02-20 19:51:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-02-20 19:51:27,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:27,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,779 INFO L74 IsIncluded]: Start isIncluded. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,781 INFO L87 Difference]: Start difference. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:27,818 INFO L93 Difference]: Finished difference Result 878 states and 1653 transitions. [2022-02-20 19:51:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:51:27,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:27,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:27,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 878 states. [2022-02-20 19:51:27,825 INFO L87 Difference]: Start difference. First operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 878 states. [2022-02-20 19:51:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:27,853 INFO L93 Difference]: Finished difference Result 878 states and 1653 transitions. [2022-02-20 19:51:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:51:27,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:27,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:27,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:27,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8869863013698631) internal successors, (1653), 877 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1653 transitions. [2022-02-20 19:51:27,884 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1653 transitions. Word has length 42 [2022-02-20 19:51:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:27,885 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1653 transitions. [2022-02-20 19:51:27,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:51:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:51:27,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:27,886 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:51:27,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:51:27,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash 325703937, now seen corresponding path program 1 times [2022-02-20 19:51:27,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:27,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861959118] [2022-02-20 19:51:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:27,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {5465#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(41, 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; {5465#true} is VALID [2022-02-20 19:51:27,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {5465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {5465#true} is VALID [2022-02-20 19:51:27,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {5465#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5465#true} is VALID [2022-02-20 19:51:27,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {5465#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5467#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:51:27,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {5467#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5468#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:51:27,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {5468#(= |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; {5469#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:51:27,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {5469#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5466#false} is VALID [2022-02-20 19:51:27,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {5466#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5466#false} is VALID [2022-02-20 19:51:27,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {5466#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 19:51:27,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {5466#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 19:51:27,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {5466#false} ~mode1~0 := 0; {5466#false} is VALID [2022-02-20 19:51:27,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {5466#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 19:51:27,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {5466#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 19:51:27,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {5466#false} ~mode2~0 := 0; {5466#false} is VALID [2022-02-20 19:51:27,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {5466#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 19:51:27,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {5466#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 19:51:27,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {5466#false} ~mode3~0 := 0; {5466#false} is VALID [2022-02-20 19:51:27,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {5466#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 19:51:27,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {5466#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 19:51:27,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {5466#false} ~mode4~0 := 0; {5466#false} is VALID [2022-02-20 19:51:27,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {5466#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5466#false} is VALID [2022-02-20 19:51:27,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {5466#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5466#false} is VALID [2022-02-20 19:51:27,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {5466#false} ~mode5~0 := 0; {5466#false} is VALID [2022-02-20 19:51:27,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {5466#false} assume !(0 != ~mode6~0 % 256); {5466#false} is VALID [2022-02-20 19:51:27,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {5466#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {5466#false} is VALID [2022-02-20 19:51:27,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {5466#false} assume !(0 != ~mode7~0 % 256); {5466#false} is VALID [2022-02-20 19:51:27,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {5466#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {5466#false} is VALID [2022-02-20 19:51:27,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {5466#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {5466#false} is VALID [2022-02-20 19:51:27,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {5466#false} check_#res#1 := check_~tmp~1#1; {5466#false} is VALID [2022-02-20 19:51:27,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {5466#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; {5466#false} is VALID [2022-02-20 19:51:27,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {5466#false} assume 0 == assert_~arg#1 % 256; {5466#false} is VALID [2022-02-20 19:51:27,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {5466#false} assume !false; {5466#false} is VALID [2022-02-20 19:51:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:27,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:27,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861959118] [2022-02-20 19:51:27,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861959118] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:27,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:27,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:51:27,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964235788] [2022-02-20 19:51:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:27,980 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:51:27,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:27,981 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:51:28,005 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:51:28,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:51:28,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:51:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:51:28,006 INFO L87 Difference]: Start difference. First operand 878 states and 1653 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:31,976 INFO L93 Difference]: Finished difference Result 950 states and 1765 transitions. [2022-02-20 19:51:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:51:31,977 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:51:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:31,977 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:51:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:51:31,983 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:51:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:51:31,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1765 transitions. [2022-02-20 19:51:33,067 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:51:33,101 INFO L225 Difference]: With dead ends: 950 [2022-02-20 19:51:33,101 INFO L226 Difference]: Without dead ends: 878 [2022-02-20 19:51:33,102 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:51:33,103 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:51:33,103 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:51:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-02-20 19:51:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-02-20 19:51:33,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:33,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:33,123 INFO L74 IsIncluded]: Start isIncluded. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:33,125 INFO L87 Difference]: Start difference. First operand 878 states. Second operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:33,154 INFO L93 Difference]: Finished difference Result 878 states and 1603 transitions. [2022-02-20 19:51:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:51:33,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:33,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:33,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 878 states. [2022-02-20 19:51:33,160 INFO L87 Difference]: Start difference. First operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 878 states. [2022-02-20 19:51:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:33,191 INFO L93 Difference]: Finished difference Result 878 states and 1603 transitions. [2022-02-20 19:51:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:51:33,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:33,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:33,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:33,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 1.8299086757990868) internal successors, (1603), 877 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1603 transitions. [2022-02-20 19:51:33,227 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1603 transitions. Word has length 42 [2022-02-20 19:51:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:33,227 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1603 transitions. [2022-02-20 19:51:33,227 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:51:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:51:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 19:51:33,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:33,229 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] [2022-02-20 19:51:33,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:51:33,230 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:33,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1873981919, now seen corresponding path program 1 times [2022-02-20 19:51:33,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:33,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072087768] [2022-02-20 19:51:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:33,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {9103#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(41, 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; {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:51:33,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {9105#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9106#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:51:33,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {9106#(not (= (+ ~a7~0 (- 12)) 0))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9104#false} is VALID [2022-02-20 19:51:33,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {9104#false} assume !false; {9104#false} is VALID [2022-02-20 19:51:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:33,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:33,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072087768] [2022-02-20 19:51:33,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072087768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:33,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:33,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:33,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348307382] [2022-02-20 19:51:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 19:51:33,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:33,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:33,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:33,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:51:33,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:51:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:51:33,449 INFO L87 Difference]: Start difference. First operand 878 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:44,646 INFO L93 Difference]: Finished difference Result 3133 states and 5912 transitions. [2022-02-20 19:51:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:51:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 19:51:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5912 transitions. [2022-02-20 19:51:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5912 transitions. [2022-02-20 19:51:44,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5912 transitions. [2022-02-20 19:51:49,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5912 edges. 5912 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:49,394 INFO L225 Difference]: With dead ends: 3133 [2022-02-20 19:51:49,394 INFO L226 Difference]: Without dead ends: 2380 [2022-02-20 19:51:49,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:51:49,396 INFO L933 BasicCegarLoop]: 857 mSDtfsCounter, 2503 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2503 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:49,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2503 Valid, 875 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-02-20 19:51:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-02-20 19:51:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2022-02-20 19:51:49,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:49,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2380 states. Second operand has 2380 states, 2378 states have (on average 1.5681244743481917) internal successors, (3729), 2379 states have internal predecessors, (3729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:49,451 INFO L74 IsIncluded]: Start isIncluded. First operand 2380 states. Second operand has 2380 states, 2378 states have (on average 1.5681244743481917) internal successors, (3729), 2379 states have internal predecessors, (3729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:49,455 INFO L87 Difference]: Start difference. First operand 2380 states. Second operand has 2380 states, 2378 states have (on average 1.5681244743481917) internal successors, (3729), 2379 states have internal predecessors, (3729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:49,616 INFO L93 Difference]: Finished difference Result 2380 states and 3729 transitions. [2022-02-20 19:51:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3729 transitions. [2022-02-20 19:51:49,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:49,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:49,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 2380 states, 2378 states have (on average 1.5681244743481917) internal successors, (3729), 2379 states have internal predecessors, (3729), 0 states have call successors, (0), 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 2380 states. [2022-02-20 19:51:49,627 INFO L87 Difference]: Start difference. First operand has 2380 states, 2378 states have (on average 1.5681244743481917) internal successors, (3729), 2379 states have internal predecessors, (3729), 0 states have call successors, (0), 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 2380 states. [2022-02-20 19:51:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:49,786 INFO L93 Difference]: Finished difference Result 2380 states and 3729 transitions. [2022-02-20 19:51:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3729 transitions. [2022-02-20 19:51:49,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:49,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:49,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:49,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2378 states have (on average 1.5681244743481917) internal successors, (3729), 2379 states have internal predecessors, (3729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3729 transitions. [2022-02-20 19:51:49,981 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3729 transitions. Word has length 63 [2022-02-20 19:51:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:49,982 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3729 transitions. [2022-02-20 19:51:49,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3729 transitions. [2022-02-20 19:51:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:49,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:49,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:49,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:51:49,987 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1207745120, now seen corresponding path program 1 times [2022-02-20 19:51:49,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:49,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218005576] [2022-02-20 19:51:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:49,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:50,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {19441#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(41, 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; {19441#true} is VALID [2022-02-20 19:51:50,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {19441#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {19441#true} is VALID [2022-02-20 19:51:50,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {19441#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19441#true} is VALID [2022-02-20 19:51:50,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {19441#true} assume 0 == ~r1~0 % 256; {19441#true} is VALID [2022-02-20 19:51:50,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {19441#true} assume ~id1~0 >= 0; {19441#true} is VALID [2022-02-20 19:51:50,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {19441#true} assume 0 == ~st1~0; {19441#true} is VALID [2022-02-20 19:51:50,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {19441#true} assume ~send1~0 == ~id1~0; {19441#true} is VALID [2022-02-20 19:51:50,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {19441#true} assume 0 == ~mode1~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {19443#(= (+ (* (- 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; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {19443#(= (+ (* (- 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; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {19443#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {19442#false} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {19442#false} assume !(node1_~m1~0#1 != ~nomsg~0); {19442#false} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {19442#false} ~mode1~0 := 0; {19442#false} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 61: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 62: Hoare triple {19442#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19442#false} is VALID [2022-02-20 19:51:50,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {19442#false} assume !(node2_~m2~0#1 != ~nomsg~0); {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {19442#false} ~mode2~0 := 0; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {19442#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {19442#false} assume !(node3_~m3~0#1 != ~nomsg~0); {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {19442#false} ~mode3~0 := 0; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {19442#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {19442#false} assume !(node4_~m4~0#1 != ~nomsg~0); {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {19442#false} ~mode4~0 := 0; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {19442#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19442#false} is VALID [2022-02-20 19:51:50,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {19442#false} assume !(node5_~m5~0#1 != ~nomsg~0); {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {19442#false} ~mode5~0 := 0; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {19442#false} assume !(0 != ~mode6~0 % 256); {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {19442#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {19442#false} assume !(0 != ~mode7~0 % 256); {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {19442#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {19442#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {19442#false} is VALID [2022-02-20 19:51:50,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {19442#false} check_#res#1 := check_~tmp~1#1; {19442#false} is VALID [2022-02-20 19:51:50,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {19442#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; {19442#false} is VALID [2022-02-20 19:51:50,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {19442#false} assume 0 == assert_~arg#1 % 256; {19442#false} is VALID [2022-02-20 19:51:50,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {19442#false} assume !false; {19442#false} is VALID [2022-02-20 19:51:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:50,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:50,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218005576] [2022-02-20 19:51:50,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218005576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:50,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:50,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:50,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345549393] [2022-02-20 19:51:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:50,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:50,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:50,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:50,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:50,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:50,233 INFO L87 Difference]: Start difference. First operand 2380 states and 3729 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:52,362 INFO L93 Difference]: Finished difference Result 2510 states and 3935 transitions. [2022-02-20 19:51:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:52,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:51:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:51:52,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:51:53,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:53,735 INFO L225 Difference]: With dead ends: 2510 [2022-02-20 19:51:53,735 INFO L226 Difference]: Without dead ends: 2442 [2022-02-20 19:51:53,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:53,737 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:51:53,737 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:51:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2022-02-20 19:51:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2022-02-20 19:51:53,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:53,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2442 states. Second operand has 2440 states, 2438 states have (on average 1.5689089417555373) internal successors, (3825), 2439 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:53,791 INFO L74 IsIncluded]: Start isIncluded. First operand 2442 states. Second operand has 2440 states, 2438 states have (on average 1.5689089417555373) internal successors, (3825), 2439 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:53,793 INFO L87 Difference]: Start difference. First operand 2442 states. Second operand has 2440 states, 2438 states have (on average 1.5689089417555373) internal successors, (3825), 2439 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:53,954 INFO L93 Difference]: Finished difference Result 2442 states and 3826 transitions. [2022-02-20 19:51:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3826 transitions. [2022-02-20 19:51:53,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:53,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:53,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 2440 states, 2438 states have (on average 1.5689089417555373) internal successors, (3825), 2439 states have internal predecessors, (3825), 0 states have call successors, (0), 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 2442 states. [2022-02-20 19:51:53,964 INFO L87 Difference]: Start difference. First operand has 2440 states, 2438 states have (on average 1.5689089417555373) internal successors, (3825), 2439 states have internal predecessors, (3825), 0 states have call successors, (0), 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 2442 states. [2022-02-20 19:51:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:54,126 INFO L93 Difference]: Finished difference Result 2442 states and 3826 transitions. [2022-02-20 19:51:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3826 transitions. [2022-02-20 19:51:54,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:54,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:54,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:54,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.5689089417555373) internal successors, (3825), 2439 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3825 transitions. [2022-02-20 19:51:54,329 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3825 transitions. Word has length 91 [2022-02-20 19:51:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:54,330 INFO L470 AbstractCegarLoop]: Abstraction has 2440 states and 3825 transitions. [2022-02-20 19:51:54,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3825 transitions. [2022-02-20 19:51:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:54,331 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:54,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:54,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:51:54,331 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1564953708, now seen corresponding path program 1 times [2022-02-20 19:51:54,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:54,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463211100] [2022-02-20 19:51:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:54,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {29362#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(41, 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; {29362#true} is VALID [2022-02-20 19:51:54,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {29362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {29362#true} is VALID [2022-02-20 19:51:54,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {29362#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29362#true} is VALID [2022-02-20 19:51:54,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {29362#true} assume 0 == ~r1~0 % 256; {29362#true} is VALID [2022-02-20 19:51:54,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {29362#true} assume ~id1~0 >= 0; {29362#true} is VALID [2022-02-20 19:51:54,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {29362#true} assume 0 == ~st1~0; {29362#true} is VALID [2022-02-20 19:51:54,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {29362#true} assume ~send1~0 == ~id1~0; {29362#true} is VALID [2022-02-20 19:51:54,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {29362#true} assume 0 == ~mode1~0 % 256; {29362#true} is VALID [2022-02-20 19:51:54,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {29362#true} assume ~id2~0 >= 0; {29362#true} is VALID [2022-02-20 19:51:54,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {29362#true} assume 0 == ~st2~0; {29362#true} is VALID [2022-02-20 19:51:54,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {29362#true} assume ~send2~0 == ~id2~0; {29362#true} is VALID [2022-02-20 19:51:54,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {29362#true} assume 0 == ~mode2~0 % 256; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {29364#(= (+ (* (- 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; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {29364#(= (+ (* (- 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; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {29364#(= (+ (* (- 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; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {29364#(= (+ (* (- 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; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {29364#(= (+ (* (- 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; {29364#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:51:54,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {29364#(= (+ (* (- 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; {29363#false} is VALID [2022-02-20 19:51:54,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {29363#false} assume !(node2_~m2~0#1 != ~nomsg~0); {29363#false} is VALID [2022-02-20 19:51:54,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {29363#false} ~mode2~0 := 0; {29363#false} is VALID [2022-02-20 19:51:54,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {29363#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {29363#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {29363#false} ~mode3~0 := 0; {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {29363#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {29363#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {29363#false} ~mode4~0 := 0; {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {29363#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {29363#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 76: Hoare triple {29363#false} ~mode5~0 := 0; {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {29363#false} assume !(0 != ~mode6~0 % 256); {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {29363#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,438 INFO L290 TraceCheckUtils]: 81: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {29363#false} assume !(0 != ~mode7~0 % 256); {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 83: Hoare triple {29363#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 84: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 85: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 86: Hoare triple {29363#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 87: Hoare triple {29363#false} check_#res#1 := check_~tmp~1#1; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 88: Hoare triple {29363#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; {29363#false} is VALID [2022-02-20 19:51:54,439 INFO L290 TraceCheckUtils]: 89: Hoare triple {29363#false} assume 0 == assert_~arg#1 % 256; {29363#false} is VALID [2022-02-20 19:51:54,440 INFO L290 TraceCheckUtils]: 90: Hoare triple {29363#false} assume !false; {29363#false} is VALID [2022-02-20 19:51:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:54,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:54,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463211100] [2022-02-20 19:51:54,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463211100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:54,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:54,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:54,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759286935] [2022-02-20 19:51:54,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:54,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:54,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:54,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:54,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:54,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:54,501 INFO L87 Difference]: Start difference. First operand 2440 states and 3825 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:56,294 INFO L93 Difference]: Finished difference Result 2684 states and 4213 transitions. [2022-02-20 19:51:56,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:56,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:51:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:51:56,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:51:57,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:57,747 INFO L225 Difference]: With dead ends: 2684 [2022-02-20 19:51:57,747 INFO L226 Difference]: Without dead ends: 2556 [2022-02-20 19:51:57,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:57,753 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:51:57,753 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:51:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-02-20 19:51:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2554. [2022-02-20 19:51:57,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:57,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2556 states. Second operand has 2554 states, 2552 states have (on average 1.5697492163009403) internal successors, (4006), 2553 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:57,868 INFO L74 IsIncluded]: Start isIncluded. First operand 2556 states. Second operand has 2554 states, 2552 states have (on average 1.5697492163009403) internal successors, (4006), 2553 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:57,872 INFO L87 Difference]: Start difference. First operand 2556 states. Second operand has 2554 states, 2552 states have (on average 1.5697492163009403) internal successors, (4006), 2553 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:58,075 INFO L93 Difference]: Finished difference Result 2556 states and 4007 transitions. [2022-02-20 19:51:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4007 transitions. [2022-02-20 19:51:58,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:58,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:58,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 2554 states, 2552 states have (on average 1.5697492163009403) internal successors, (4006), 2553 states have internal predecessors, (4006), 0 states have call successors, (0), 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 2556 states. [2022-02-20 19:51:58,109 INFO L87 Difference]: Start difference. First operand has 2554 states, 2552 states have (on average 1.5697492163009403) internal successors, (4006), 2553 states have internal predecessors, (4006), 0 states have call successors, (0), 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 2556 states. [2022-02-20 19:51:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:58,362 INFO L93 Difference]: Finished difference Result 2556 states and 4007 transitions. [2022-02-20 19:51:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4007 transitions. [2022-02-20 19:51:58,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:58,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:58,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:58,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2552 states have (on average 1.5697492163009403) internal successors, (4006), 2553 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4006 transitions. [2022-02-20 19:51:58,547 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4006 transitions. Word has length 91 [2022-02-20 19:51:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:58,547 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4006 transitions. [2022-02-20 19:51:58,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4006 transitions. [2022-02-20 19:51:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:58,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:58,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:58,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:51:58,549 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1479108296, now seen corresponding path program 1 times [2022-02-20 19:51:58,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:58,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103362325] [2022-02-20 19:51:58,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:58,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:58,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {39849#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(41, 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; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {39849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {39849#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {39849#true} assume 0 == ~r1~0 % 256; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {39849#true} assume ~id1~0 >= 0; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {39849#true} assume 0 == ~st1~0; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {39849#true} assume ~send1~0 == ~id1~0; {39849#true} is VALID [2022-02-20 19:51:58,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {39849#true} assume 0 == ~mode1~0 % 256; {39849#true} is VALID [2022-02-20 19:51:58,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {39849#true} assume ~id2~0 >= 0; {39849#true} is VALID [2022-02-20 19:51:58,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {39849#true} assume 0 == ~st2~0; {39849#true} is VALID [2022-02-20 19:51:58,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {39849#true} assume ~send2~0 == ~id2~0; {39849#true} is VALID [2022-02-20 19:51:58,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {39849#true} assume 0 == ~mode2~0 % 256; {39849#true} is VALID [2022-02-20 19:51:58,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {39849#true} assume ~id3~0 >= 0; {39849#true} is VALID [2022-02-20 19:51:58,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {39849#true} assume 0 == ~st3~0; {39849#true} is VALID [2022-02-20 19:51:58,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {39849#true} assume ~send3~0 == ~id3~0; {39849#true} is VALID [2022-02-20 19:51:58,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {39849#true} assume 0 == ~mode3~0 % 256; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {39851#(= (+ (* (- 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; {39851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:58,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {39851#(= (+ (* (- 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; {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {39850#false} assume !(node3_~m3~0#1 != ~nomsg~0); {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {39850#false} ~mode3~0 := 0; {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {39850#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {39850#false} assume !(node4_~m4~0#1 != ~nomsg~0); {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {39850#false} ~mode4~0 := 0; {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {39850#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 75: Hoare triple {39850#false} assume !(node5_~m5~0#1 != ~nomsg~0); {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {39850#false} ~mode5~0 := 0; {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 78: Hoare triple {39850#false} assume !(0 != ~mode6~0 % 256); {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {39850#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,683 INFO L290 TraceCheckUtils]: 82: Hoare triple {39850#false} assume !(0 != ~mode7~0 % 256); {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {39850#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 86: Hoare triple {39850#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 87: Hoare triple {39850#false} check_#res#1 := check_~tmp~1#1; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 88: Hoare triple {39850#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; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 89: Hoare triple {39850#false} assume 0 == assert_~arg#1 % 256; {39850#false} is VALID [2022-02-20 19:51:58,684 INFO L290 TraceCheckUtils]: 90: Hoare triple {39850#false} assume !false; {39850#false} is VALID [2022-02-20 19:51:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:58,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:58,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103362325] [2022-02-20 19:51:58,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103362325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:58,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:58,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:58,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451417204] [2022-02-20 19:51:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:58,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:58,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:58,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:58,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:58,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:58,742 INFO L87 Difference]: Start difference. First operand 2554 states and 4006 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:52:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:00,710 INFO L93 Difference]: Finished difference Result 3014 states and 4736 transitions. [2022-02-20 19:52:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:52:00,710 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:52:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:00,711 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:52:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:52:00,716 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:52:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:52:00,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:52:02,332 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:52:02,538 INFO L225 Difference]: With dead ends: 3014 [2022-02-20 19:52:02,538 INFO L226 Difference]: Without dead ends: 2772 [2022-02-20 19:52:02,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:52:02,539 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:52:02,540 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:52:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2022-02-20 19:52:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2770. [2022-02-20 19:52:02,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:02,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2772 states. Second operand has 2770 states, 2768 states have (on average 1.5700867052023122) internal successors, (4346), 2769 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:02,647 INFO L74 IsIncluded]: Start isIncluded. First operand 2772 states. Second operand has 2770 states, 2768 states have (on average 1.5700867052023122) internal successors, (4346), 2769 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:02,648 INFO L87 Difference]: Start difference. First operand 2772 states. Second operand has 2770 states, 2768 states have (on average 1.5700867052023122) internal successors, (4346), 2769 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:02,837 INFO L93 Difference]: Finished difference Result 2772 states and 4347 transitions. [2022-02-20 19:52:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4347 transitions. [2022-02-20 19:52:02,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:02,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:02,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 2770 states, 2768 states have (on average 1.5700867052023122) internal successors, (4346), 2769 states have internal predecessors, (4346), 0 states have call successors, (0), 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 2772 states. [2022-02-20 19:52:02,844 INFO L87 Difference]: Start difference. First operand has 2770 states, 2768 states have (on average 1.5700867052023122) internal successors, (4346), 2769 states have internal predecessors, (4346), 0 states have call successors, (0), 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 2772 states. [2022-02-20 19:52:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:03,041 INFO L93 Difference]: Finished difference Result 2772 states and 4347 transitions. [2022-02-20 19:52:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4347 transitions. [2022-02-20 19:52:03,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:03,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:03,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:03,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2768 states have (on average 1.5700867052023122) internal successors, (4346), 2769 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 4346 transitions. [2022-02-20 19:52:03,258 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 4346 transitions. Word has length 91 [2022-02-20 19:52:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:03,258 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 4346 transitions. [2022-02-20 19:52:03,258 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:52:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 4346 transitions. [2022-02-20 19:52:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:52:03,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:03,259 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:52:03,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:52:03,261 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash 733525566, now seen corresponding path program 1 times [2022-02-20 19:52:03,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:03,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213029605] [2022-02-20 19:52:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:03,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {51414#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(41, 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; {51414#true} is VALID [2022-02-20 19:52:03,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {51414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {51414#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {51414#true} assume 0 == ~r1~0 % 256; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {51414#true} assume ~id1~0 >= 0; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {51414#true} assume 0 == ~st1~0; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {51414#true} assume ~send1~0 == ~id1~0; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {51414#true} assume 0 == ~mode1~0 % 256; {51414#true} is VALID [2022-02-20 19:52:03,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {51414#true} assume ~id2~0 >= 0; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {51414#true} assume 0 == ~st2~0; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {51414#true} assume ~send2~0 == ~id2~0; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {51414#true} assume 0 == ~mode2~0 % 256; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {51414#true} assume ~id3~0 >= 0; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {51414#true} assume 0 == ~st3~0; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {51414#true} assume ~send3~0 == ~id3~0; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {51414#true} assume 0 == ~mode3~0 % 256; {51414#true} is VALID [2022-02-20 19:52:03,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {51414#true} assume ~id4~0 >= 0; {51414#true} is VALID [2022-02-20 19:52:03,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {51414#true} assume 0 == ~st4~0; {51414#true} is VALID [2022-02-20 19:52:03,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {51414#true} assume ~send4~0 == ~id4~0; {51414#true} is VALID [2022-02-20 19:52:03,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {51414#true} assume 0 == ~mode4~0 % 256; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {51416#(= (+ (* (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; {51416#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:52:03,326 INFO L290 TraceCheckUtils]: 70: Hoare triple {51416#(= (+ (* (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; {51415#false} is VALID [2022-02-20 19:52:03,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {51415#false} assume !(node4_~m4~0#1 != ~nomsg~0); {51415#false} is VALID [2022-02-20 19:52:03,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {51415#false} ~mode4~0 := 0; {51415#false} is VALID [2022-02-20 19:52:03,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {51415#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {51415#false} is VALID [2022-02-20 19:52:03,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {51415#false} assume !(node5_~m5~0#1 != ~nomsg~0); {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 76: Hoare triple {51415#false} ~mode5~0 := 0; {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 77: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 78: Hoare triple {51415#false} assume !(0 != ~mode6~0 % 256); {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 79: Hoare triple {51415#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 80: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 81: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 82: Hoare triple {51415#false} assume !(0 != ~mode7~0 % 256); {51415#false} is VALID [2022-02-20 19:52:03,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {51415#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 86: Hoare triple {51415#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {51415#false} check_#res#1 := check_~tmp~1#1; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 88: Hoare triple {51415#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; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 89: Hoare triple {51415#false} assume 0 == assert_~arg#1 % 256; {51415#false} is VALID [2022-02-20 19:52:03,328 INFO L290 TraceCheckUtils]: 90: Hoare triple {51415#false} assume !false; {51415#false} is VALID [2022-02-20 19:52:03,329 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:52:03,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:03,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213029605] [2022-02-20 19:52:03,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213029605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:03,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:03,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:52:03,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100122686] [2022-02-20 19:52:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:03,330 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:52:03,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:03,330 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:52:03,378 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:52:03,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:52:03,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:52:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:52:03,379 INFO L87 Difference]: Start difference. First operand 2770 states and 4346 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:52:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:05,374 INFO L93 Difference]: Finished difference Result 3638 states and 5716 transitions. [2022-02-20 19:52:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:52:05,374 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:52:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:05,374 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:52:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:52:05,379 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:52:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:52:05,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:52:06,893 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:52:07,260 INFO L225 Difference]: With dead ends: 3638 [2022-02-20 19:52:07,261 INFO L226 Difference]: Without dead ends: 3180 [2022-02-20 19:52:07,262 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:52:07,263 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:52:07,263 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:52:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-02-20 19:52:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3178. [2022-02-20 19:52:07,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:07,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3180 states. Second operand has 3178 states, 3176 states have (on average 1.568639798488665) internal successors, (4982), 3177 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:07,435 INFO L74 IsIncluded]: Start isIncluded. First operand 3180 states. Second operand has 3178 states, 3176 states have (on average 1.568639798488665) internal successors, (4982), 3177 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:07,437 INFO L87 Difference]: Start difference. First operand 3180 states. Second operand has 3178 states, 3176 states have (on average 1.568639798488665) internal successors, (4982), 3177 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:07,727 INFO L93 Difference]: Finished difference Result 3180 states and 4983 transitions. [2022-02-20 19:52:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4983 transitions. [2022-02-20 19:52:07,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:07,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:07,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 3178 states, 3176 states have (on average 1.568639798488665) internal successors, (4982), 3177 states have internal predecessors, (4982), 0 states have call successors, (0), 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 3180 states. [2022-02-20 19:52:07,735 INFO L87 Difference]: Start difference. First operand has 3178 states, 3176 states have (on average 1.568639798488665) internal successors, (4982), 3177 states have internal predecessors, (4982), 0 states have call successors, (0), 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 3180 states. [2022-02-20 19:52:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:08,013 INFO L93 Difference]: Finished difference Result 3180 states and 4983 transitions. [2022-02-20 19:52:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4983 transitions. [2022-02-20 19:52:08,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:08,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:08,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:08,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 3176 states have (on average 1.568639798488665) internal successors, (4982), 3177 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4982 transitions. [2022-02-20 19:52:08,392 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4982 transitions. Word has length 91 [2022-02-20 19:52:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:08,407 INFO L470 AbstractCegarLoop]: Abstraction has 3178 states and 4982 transitions. [2022-02-20 19:52:08,408 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:52:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4982 transitions. [2022-02-20 19:52:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:52:08,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:08,408 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:52:08,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:52:08,409 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1206505292, now seen corresponding path program 1 times [2022-02-20 19:52:08,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:08,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167532971] [2022-02-20 19:52:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:08,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {65027#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(41, 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; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {65027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {65027#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {65027#true} assume 0 == ~r1~0 % 256; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {65027#true} assume ~id1~0 >= 0; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {65027#true} assume 0 == ~st1~0; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {65027#true} assume ~send1~0 == ~id1~0; {65027#true} is VALID [2022-02-20 19:52:08,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {65027#true} assume 0 == ~mode1~0 % 256; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {65027#true} assume ~id2~0 >= 0; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {65027#true} assume 0 == ~st2~0; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {65027#true} assume ~send2~0 == ~id2~0; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {65027#true} assume 0 == ~mode2~0 % 256; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {65027#true} assume ~id3~0 >= 0; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {65027#true} assume 0 == ~st3~0; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {65027#true} assume ~send3~0 == ~id3~0; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {65027#true} assume 0 == ~mode3~0 % 256; {65027#true} is VALID [2022-02-20 19:52:08,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {65027#true} assume ~id4~0 >= 0; {65027#true} is VALID [2022-02-20 19:52:08,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {65027#true} assume 0 == ~st4~0; {65027#true} is VALID [2022-02-20 19:52:08,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {65027#true} assume ~send4~0 == ~id4~0; {65027#true} is VALID [2022-02-20 19:52:08,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {65027#true} assume 0 == ~mode4~0 % 256; {65027#true} is VALID [2022-02-20 19:52:08,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {65027#true} assume ~id5~0 >= 0; {65027#true} is VALID [2022-02-20 19:52:08,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {65027#true} assume 0 == ~st5~0; {65027#true} is VALID [2022-02-20 19:52:08,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {65027#true} assume ~send5~0 == ~id5~0; {65027#true} is VALID [2022-02-20 19:52:08,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {65027#true} assume 0 == ~mode5~0 % 256; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,497 INFO L290 TraceCheckUtils]: 63: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,497 INFO L290 TraceCheckUtils]: 64: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,498 INFO L290 TraceCheckUtils]: 67: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,498 INFO L290 TraceCheckUtils]: 68: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {65029#(= (+ (* (- 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; {65029#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {65029#(= (+ (* (- 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; {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {65028#false} assume !(node5_~m5~0#1 != ~nomsg~0); {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {65028#false} ~mode5~0 := 0; {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {65028#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; {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 78: Hoare triple {65028#false} assume !(0 != ~mode6~0 % 256); {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {65028#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {65028#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; {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {65028#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; {65028#false} is VALID [2022-02-20 19:52:08,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {65028#false} assume !(0 != ~mode7~0 % 256); {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {65028#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {65028#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; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {65028#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; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {65028#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {65028#false} check_#res#1 := check_~tmp~1#1; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {65028#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; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {65028#false} assume 0 == assert_~arg#1 % 256; {65028#false} is VALID [2022-02-20 19:52:08,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {65028#false} assume !false; {65028#false} is VALID [2022-02-20 19:52:08,503 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:52:08,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:08,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167532971] [2022-02-20 19:52:08,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167532971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:08,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:08,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:52:08,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52771371] [2022-02-20 19:52:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:08,504 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:52:08,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:08,504 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:52:08,557 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:52:08,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:52:08,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:08,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:52:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:52:08,558 INFO L87 Difference]: Start difference. First operand 3178 states and 4982 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:52:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:11,056 INFO L93 Difference]: Finished difference Result 4814 states and 7544 transitions. [2022-02-20 19:52:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:52:11,056 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:52:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:11,057 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:52:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:52:11,062 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:52:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:52:11,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:52:12,125 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:52:12,761 INFO L225 Difference]: With dead ends: 4814 [2022-02-20 19:52:12,762 INFO L226 Difference]: Without dead ends: 3948 [2022-02-20 19:52:12,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:52:12,764 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:52:12,765 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:52:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-02-20 19:52:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3946. [2022-02-20 19:52:13,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:13,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3948 states. Second operand has 3946 states, 3944 states have (on average 1.5633874239350913) internal successors, (6166), 3945 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:13,099 INFO L74 IsIncluded]: Start isIncluded. First operand 3948 states. Second operand has 3946 states, 3944 states have (on average 1.5633874239350913) internal successors, (6166), 3945 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:13,101 INFO L87 Difference]: Start difference. First operand 3948 states. Second operand has 3946 states, 3944 states have (on average 1.5633874239350913) internal successors, (6166), 3945 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:13,567 INFO L93 Difference]: Finished difference Result 3948 states and 6167 transitions. [2022-02-20 19:52:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 6167 transitions. [2022-02-20 19:52:13,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:13,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:13,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 3946 states, 3944 states have (on average 1.5633874239350913) internal successors, (6166), 3945 states have internal predecessors, (6166), 0 states have call successors, (0), 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 3948 states. [2022-02-20 19:52:13,577 INFO L87 Difference]: Start difference. First operand has 3946 states, 3944 states have (on average 1.5633874239350913) internal successors, (6166), 3945 states have internal predecessors, (6166), 0 states have call successors, (0), 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 3948 states. [2022-02-20 19:52:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:14,076 INFO L93 Difference]: Finished difference Result 3948 states and 6167 transitions. [2022-02-20 19:52:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 6167 transitions. [2022-02-20 19:52:14,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:14,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:14,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:14,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3944 states have (on average 1.5633874239350913) internal successors, (6166), 3945 states have internal predecessors, (6166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 6166 transitions. [2022-02-20 19:52:14,606 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 6166 transitions. Word has length 91 [2022-02-20 19:52:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:14,606 INFO L470 AbstractCegarLoop]: Abstraction has 3946 states and 6166 transitions. [2022-02-20 19:52:14,607 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:52:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 6166 transitions. [2022-02-20 19:52:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:52:14,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:14,607 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:52:14,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:52:14,608 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:14,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1494177322, now seen corresponding path program 1 times [2022-02-20 19:52:14,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:14,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364331393] [2022-02-20 19:52:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:14,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:14,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {82520#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(41, 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; {82520#true} is VALID [2022-02-20 19:52:14,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {82520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {82520#true} is VALID [2022-02-20 19:52:14,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {82520#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {82520#true} is VALID [2022-02-20 19:52:14,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {82520#true} assume 0 == ~r1~0 % 256; {82520#true} is VALID [2022-02-20 19:52:14,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {82520#true} assume ~id1~0 >= 0; {82520#true} is VALID [2022-02-20 19:52:14,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {82520#true} assume 0 == ~st1~0; {82522#(<= ~st1~0 0)} is VALID [2022-02-20 19:52:14,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {82522#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {82522#(<= ~st1~0 0)} is VALID [2022-02-20 19:52:14,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {82522#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {82522#(<= ~st1~0 0)} is VALID [2022-02-20 19:52:14,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {82522#(<= ~st1~0 0)} assume ~id2~0 >= 0; {82522#(<= ~st1~0 0)} is VALID [2022-02-20 19:52:14,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {82522#(<= ~st1~0 0)} assume 0 == ~st2~0; {82523#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {82523#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {82523#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {82523#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {82523#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {82523#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {82523#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {82523#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {82524#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {82525#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:52:14,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {82526#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {82527#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,722 INFO L290 TraceCheckUtils]: 67: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,723 INFO L290 TraceCheckUtils]: 68: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,723 INFO L290 TraceCheckUtils]: 69: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,724 INFO L290 TraceCheckUtils]: 71: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,724 INFO L290 TraceCheckUtils]: 72: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,725 INFO L290 TraceCheckUtils]: 75: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,726 INFO L290 TraceCheckUtils]: 78: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,727 INFO L290 TraceCheckUtils]: 80: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,727 INFO L290 TraceCheckUtils]: 81: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,729 INFO L290 TraceCheckUtils]: 85: Hoare triple {82528#(<= (+ ~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; {82528#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:52:14,729 INFO L290 TraceCheckUtils]: 86: Hoare triple {82528#(<= (+ ~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; {82521#false} is VALID [2022-02-20 19:52:14,729 INFO L290 TraceCheckUtils]: 87: Hoare triple {82521#false} check_#res#1 := check_~tmp~1#1; {82521#false} is VALID [2022-02-20 19:52:14,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {82521#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; {82521#false} is VALID [2022-02-20 19:52:14,730 INFO L290 TraceCheckUtils]: 89: Hoare triple {82521#false} assume 0 == assert_~arg#1 % 256; {82521#false} is VALID [2022-02-20 19:52:14,730 INFO L290 TraceCheckUtils]: 90: Hoare triple {82521#false} assume !false; {82521#false} is VALID [2022-02-20 19:52:14,730 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:52:14,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:14,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364331393] [2022-02-20 19:52:14,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364331393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:14,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:14,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:52:14,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143076529] [2022-02-20 19:52:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:14,731 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:52:14,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:14,732 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:52:14,792 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:52:14,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:52:14,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:14,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:52:14,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:52:14,793 INFO L87 Difference]: Start difference. First operand 3946 states and 6166 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)