./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.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.ufo.BOUNDED-14.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 3f245de30dfee26478636e7d9fa9efe6ce58392e3e0e904da5deeb619cf87f28 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:49:34,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:49:34,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:49:34,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:49:34,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:49:34,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:49:34,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:49:34,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:49:34,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:49:34,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:49:34,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:49:34,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:49:34,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:49:34,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:49:34,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:49:34,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:49:34,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:49:34,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:49:34,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:49:34,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:49:34,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:49:34,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:49:34,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:49:34,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:49:34,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:49:34,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:49:34,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:49:34,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:49:34,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:49:34,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:49:34,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:49:34,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:49:34,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:49:34,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:49:34,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:49:34,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:49:34,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:49:34,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:49:34,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:49:34,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:49:34,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:49:34,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:49:34,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:49:34,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:49:34,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:49:34,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:49:34,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:49:34,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:49:34,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:49:34,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:49:34,975 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:49:34,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:49:34,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:49:34,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:49:34,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:49:34,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:49:34,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:49:34,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:49:34,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:49:34,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:49:34,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:49:34,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:49:34,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:49:34,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:49:34,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:49:34,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:49:34,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:34,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:49:34,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:49:34,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:49:34,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:49:34,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:49:34,978 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:49:34,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:49:34,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:49:34,979 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 -> 3f245de30dfee26478636e7d9fa9efe6ce58392e3e0e904da5deeb619cf87f28 [2022-02-20 19:49:35,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:49:35,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:49:35,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:49:35,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:49:35,169 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:49:35,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c [2022-02-20 19:49:35,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b41a93/034bb787c9b246f39a01e783572b8df0/FLAG4fcf36167 [2022-02-20 19:49:35,824 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:49:35,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c [2022-02-20 19:49:35,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b41a93/034bb787c9b246f39a01e783572b8df0/FLAG4fcf36167 [2022-02-20 19:49:36,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b41a93/034bb787c9b246f39a01e783572b8df0 [2022-02-20 19:49:36,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:49:36,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:49:36,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:49:36,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:49:36,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:49:36,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:49:36" (1/1) ... [2022-02-20 19:49:36,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575c8699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:36, skipping insertion in model container [2022-02-20 19:49:36,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:49:36" (1/1) ... [2022-02-20 19:49:36,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:49:36,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:49:36,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c[20426,20439] [2022-02-20 19:49:36,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c[27716,27729] [2022-02-20 19:49:37,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:49:37,171 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:49:37,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c[20426,20439] [2022-02-20 19:49:37,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c[27716,27729] [2022-02-20 19:49:37,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:49:37,538 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:49:37,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37 WrapperNode [2022-02-20 19:49:37,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:49:37,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:49:37,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:49:37,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:49:37,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:37,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:37,898 INFO L137 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5210 [2022-02-20 19:49:37,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:49:37,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:49:37,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:49:37,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:49:37,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:37,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:37,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:37,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:38,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:38,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:38,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:38,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:49:38,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:49:38,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:49:38,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:49:38,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (1/1) ... [2022-02-20 19:49:38,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:49:38,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:49:38,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:49:38,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:49:38,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:49:38,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:49:38,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:49:38,478 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:49:38,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:49:44,756 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:49:44,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:49:44,776 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:49:44,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:49:44 BoogieIcfgContainer [2022-02-20 19:49:44,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:49:44,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:49:44,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:49:44,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:49:44,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:49:36" (1/3) ... [2022-02-20 19:49:44,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60498697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:49:44, skipping insertion in model container [2022-02-20 19:49:44,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:37" (2/3) ... [2022-02-20 19:49:44,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60498697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:49:44, skipping insertion in model container [2022-02-20 19:49:44,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:49:44" (3/3) ... [2022-02-20 19:49:44,787 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label02.c [2022-02-20 19:49:44,794 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:49:44,794 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:49:44,829 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:49:44,840 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:49:44,841 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:49:44,878 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:49:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:49:44,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:44,888 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:49:44,889 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:44,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash 720070723, now seen corresponding path program 1 times [2022-02-20 19:49:44,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:44,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11382959] [2022-02-20 19:49:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:45,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {947#true} is VALID [2022-02-20 19:49:45,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {947#true} is VALID [2022-02-20 19:49:45,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {947#true} is VALID [2022-02-20 19:49:45,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {947#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {947#true} is VALID [2022-02-20 19:49:45,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {947#true} init_#res#1 := init_~tmp~0#1; {947#true} is VALID [2022-02-20 19:49:45,136 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:49:45,139 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:49:45,140 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:49:45,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#false} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:49:45,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {948#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {948#false} is VALID [2022-02-20 19:49:45,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#false} assume !(node1_~m1~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:49:45,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {948#false} ~mode1~0 := 0; {948#false} is VALID [2022-02-20 19:49:45,141 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:49:45,141 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:49:45,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#false} assume !(node2_~m2~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:49:45,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#false} ~mode2~0 := 0; {948#false} is VALID [2022-02-20 19:49:45,142 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:49:45,142 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:49:45,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {948#false} assume !(node3_~m3~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:49:45,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#false} ~mode3~0 := 0; {948#false} is VALID [2022-02-20 19:49:45,143 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:49:45,143 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:49:45,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {948#false} assume !(node4_~m4~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:49:45,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {948#false} ~mode4~0 := 0; {948#false} is VALID [2022-02-20 19:49:45,143 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:49:45,144 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:49:45,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {948#false} assume !(node5_~m5~0#1 != ~nomsg~0); {948#false} is VALID [2022-02-20 19:49:45,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {948#false} ~mode5~0 := 0; {948#false} is VALID [2022-02-20 19:49:45,144 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:49:45,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {948#false} assume !(0 != ~mode6~0 % 256); {948#false} is VALID [2022-02-20 19:49:45,145 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:49:45,145 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:49:45,145 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:49:45,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {948#false} assume !(0 != ~mode7~0 % 256); {948#false} is VALID [2022-02-20 19:49:45,146 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:49:45,146 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:49:45,146 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:49:45,146 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:49:45,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {948#false} check_#res#1 := check_~tmp~1#1; {948#false} is VALID [2022-02-20 19:49:45,147 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:49:45,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {948#false} assume 0 == assert_~arg#1 % 256; {948#false} is VALID [2022-02-20 19:49:45,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 19:49:45,148 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:49:45,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:45,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11382959] [2022-02-20 19:49:45,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11382959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:45,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:45,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:49:45,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381754621] [2022-02-20 19:49:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:45,155 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:49:45,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:45,158 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:49:45,189 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:49:45,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:49:45,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:49:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:49:45,208 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:49:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:46,489 INFO L93 Difference]: Finished difference Result 1832 states and 3464 transitions. [2022-02-20 19:49:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:49:46,489 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:49:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:49:46,491 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:49:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3464 transitions. [2022-02-20 19:49:46,532 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:49:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3464 transitions. [2022-02-20 19:49:46,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3464 transitions. [2022-02-20 19:49:49,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3464 edges. 3464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:49,125 INFO L225 Difference]: With dead ends: 1832 [2022-02-20 19:49:49,125 INFO L226 Difference]: Without dead ends: 878 [2022-02-20 19:49:49,132 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:49:49,135 INFO L933 BasicCegarLoop]: 1720 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:49:49,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:49:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-02-20 19:49:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-02-20 19:49:49,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:49:49,206 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:49:49,208 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:49:49,209 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:49:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:49,245 INFO L93 Difference]: Finished difference Result 878 states and 1653 transitions. [2022-02-20 19:49:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:49:49,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:49,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:49,254 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:49:49,260 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:49:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:49,288 INFO L93 Difference]: Finished difference Result 878 states and 1653 transitions. [2022-02-20 19:49:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:49:49,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:49,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:49,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:49:49,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:49:49,292 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:49:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1653 transitions. [2022-02-20 19:49:49,319 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1653 transitions. Word has length 42 [2022-02-20 19:49:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:49:49,319 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1653 transitions. [2022-02-20 19:49:49,319 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:49:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1653 transitions. [2022-02-20 19:49:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:49:49,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:49,321 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:49:49,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:49:49,321 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash 325703937, now seen corresponding path program 1 times [2022-02-20 19:49:49,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:49,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079773271] [2022-02-20 19:49:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:49,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {5468#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5468#true} is VALID [2022-02-20 19:49:49,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {5468#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {5468#true} is VALID [2022-02-20 19:49:49,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {5468#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5468#true} is VALID [2022-02-20 19:49:49,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {5468#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5470#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:49:49,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {5470#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5471#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:49:49,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {5471#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5472#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:49:49,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {5472#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5469#false} is VALID [2022-02-20 19:49:49,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {5469#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5469#false} is VALID [2022-02-20 19:49:49,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {5469#false} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {5469#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {5469#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:49:49,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {5469#false} ~mode1~0 := 0; {5469#false} is VALID [2022-02-20 19:49:49,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {5469#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {5469#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {5469#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:49:49,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {5469#false} ~mode2~0 := 0; {5469#false} is VALID [2022-02-20 19:49:49,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {5469#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {5469#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {5469#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:49:49,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {5469#false} ~mode3~0 := 0; {5469#false} is VALID [2022-02-20 19:49:49,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {5469#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {5469#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {5469#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:49:49,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {5469#false} ~mode4~0 := 0; {5469#false} is VALID [2022-02-20 19:49:49,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {5469#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {5469#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {5469#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5469#false} is VALID [2022-02-20 19:49:49,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {5469#false} ~mode5~0 := 0; {5469#false} is VALID [2022-02-20 19:49:49,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {5469#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {5469#false} assume !(0 != ~mode6~0 % 256); {5469#false} is VALID [2022-02-20 19:49:49,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {5469#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {5469#false} is VALID [2022-02-20 19:49:49,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {5469#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {5469#false} is VALID [2022-02-20 19:49:49,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {5469#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5469#false} is VALID [2022-02-20 19:49:49,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {5469#false} assume !(0 != ~mode7~0 % 256); {5469#false} is VALID [2022-02-20 19:49:49,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {5469#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {5469#false} is VALID [2022-02-20 19:49:49,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {5469#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {5469#false} is VALID [2022-02-20 19:49:49,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {5469#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5469#false} is VALID [2022-02-20 19:49:49,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {5469#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {5469#false} is VALID [2022-02-20 19:49:49,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {5469#false} check_#res#1 := check_~tmp~1#1; {5469#false} is VALID [2022-02-20 19:49:49,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {5469#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5469#false} is VALID [2022-02-20 19:49:49,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {5469#false} assume 0 == assert_~arg#1 % 256; {5469#false} is VALID [2022-02-20 19:49:49,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {5469#false} assume !false; {5469#false} is VALID [2022-02-20 19:49:49,405 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:49:49,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:49,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079773271] [2022-02-20 19:49:49,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079773271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:49,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:49,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:49:49,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892201543] [2022-02-20 19:49:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:49,407 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:49:49,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:49,408 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:49:49,431 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:49:49,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:49:49,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:49:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:49:49,434 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:49:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:53,284 INFO L93 Difference]: Finished difference Result 950 states and 1765 transitions. [2022-02-20 19:49:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:49:53,284 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:49:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:49:53,285 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:49:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:49:53,292 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:49:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:49:53,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1765 transitions. [2022-02-20 19:49:54,499 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:49:54,523 INFO L225 Difference]: With dead ends: 950 [2022-02-20 19:49:54,524 INFO L226 Difference]: Without dead ends: 878 [2022-02-20 19:49:54,524 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:49:54,525 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:49:54,526 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:49:54,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-02-20 19:49:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-02-20 19:49:54,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:49:54,542 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:49:54,543 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:49:54,545 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:49:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:54,574 INFO L93 Difference]: Finished difference Result 878 states and 1603 transitions. [2022-02-20 19:49:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:49:54,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:54,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:54,577 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:49:54,579 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:49:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:54,608 INFO L93 Difference]: Finished difference Result 878 states and 1603 transitions. [2022-02-20 19:49:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:49:54,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:54,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:54,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:49:54,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:49:54,613 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:49:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1603 transitions. [2022-02-20 19:49:54,640 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1603 transitions. Word has length 42 [2022-02-20 19:49:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:49:54,640 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1603 transitions. [2022-02-20 19:49:54,641 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:49:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1603 transitions. [2022-02-20 19:49:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 19:49:54,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:54,644 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:49:54,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:49:54,644 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1873981919, now seen corresponding path program 1 times [2022-02-20 19:49:54,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:54,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120193273] [2022-02-20 19:49:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:54,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {9106#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {9108#(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~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet58#1);havoc main_#t~nondet58#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet56#1, main2_#t~ret57#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {9108#(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~nondet56#1 && main2_#t~nondet56#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet56#1;havoc main2_#t~nondet56#1; {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {9108#(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~ret53#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {9108#(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); {9108#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:49:54,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {9108#(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); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9109#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:49:54,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {9109#(not (= (+ ~a7~0 (- 12)) 0))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9107#false} is VALID [2022-02-20 19:49:54,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {9107#false} assume !false; {9107#false} is VALID [2022-02-20 19:49:54,864 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:49:54,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:54,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120193273] [2022-02-20 19:49:54,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120193273] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:54,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:54,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:49:54,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14962140] [2022-02-20 19:49:54,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:54,865 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:49:54,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:54,866 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:49:54,914 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:49:54,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:49:54,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:49:54,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:49:54,915 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:50:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:07,390 INFO L93 Difference]: Finished difference Result 3133 states and 5912 transitions. [2022-02-20 19:50:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:50:07,390 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:50:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:07,392 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:50:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5912 transitions. [2022-02-20 19:50:07,414 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:50:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5912 transitions. [2022-02-20 19:50:07,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5912 transitions. [2022-02-20 19:50:11,842 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:50:11,985 INFO L225 Difference]: With dead ends: 3133 [2022-02-20 19:50:11,985 INFO L226 Difference]: Without dead ends: 2380 [2022-02-20 19:50:11,986 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:50:11,992 INFO L933 BasicCegarLoop]: 857 mSDtfsCounter, 2503 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:11,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2503 Valid, 875 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-02-20 19:50:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-02-20 19:50:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2022-02-20 19:50:12,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:12,043 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:50:12,047 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:50:12,050 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:50:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:12,192 INFO L93 Difference]: Finished difference Result 2380 states and 3729 transitions. [2022-02-20 19:50:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3729 transitions. [2022-02-20 19:50:12,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:12,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:12,201 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:50:12,215 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:50:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:12,355 INFO L93 Difference]: Finished difference Result 2380 states and 3729 transitions. [2022-02-20 19:50:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3729 transitions. [2022-02-20 19:50:12,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:12,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:12,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:12,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:12,362 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:50:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3729 transitions. [2022-02-20 19:50:12,510 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3729 transitions. Word has length 63 [2022-02-20 19:50:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:12,511 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3729 transitions. [2022-02-20 19:50:12,511 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:50:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3729 transitions. [2022-02-20 19:50:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:12,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:12,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:12,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:50:12,515 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1207745120, now seen corresponding path program 1 times [2022-02-20 19:50:12,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:12,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095631160] [2022-02-20 19:50:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:12,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {19444#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {19444#true} is VALID [2022-02-20 19:50:12,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {19444#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {19444#true} is VALID [2022-02-20 19:50:12,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {19444#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19444#true} is VALID [2022-02-20 19:50:12,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {19444#true} assume 0 == ~r1~0; {19444#true} is VALID [2022-02-20 19:50:12,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {19444#true} assume ~id1~0 >= 0; {19444#true} is VALID [2022-02-20 19:50:12,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {19444#true} assume 0 == ~st1~0; {19444#true} is VALID [2022-02-20 19:50:12,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {19444#true} assume ~send1~0 == ~id1~0; {19444#true} is VALID [2022-02-20 19:50:12,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {19444#true} assume 0 == ~mode1~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,635 INFO L290 TraceCheckUtils]: 49: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {19446#(= (+ (* (- 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; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {19446#(= (+ (* (- 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; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:12,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {19446#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {19445#false} assume !(node1_~m1~0#1 != ~nomsg~0); {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {19445#false} ~mode1~0 := 0; {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {19445#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {19445#false} assume !(node2_~m2~0#1 != ~nomsg~0); {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {19445#false} ~mode2~0 := 0; {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {19445#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {19445#false} assume !(node3_~m3~0#1 != ~nomsg~0); {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {19445#false} ~mode3~0 := 0; {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {19445#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {19445#false} assume !(node4_~m4~0#1 != ~nomsg~0); {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {19445#false} ~mode4~0 := 0; {19445#false} is VALID [2022-02-20 19:50:12,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {19445#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19445#false} is VALID [2022-02-20 19:50:12,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {19445#false} assume !(node5_~m5~0#1 != ~nomsg~0); {19445#false} is VALID [2022-02-20 19:50:12,644 INFO L290 TraceCheckUtils]: 76: Hoare triple {19445#false} ~mode5~0 := 0; {19445#false} is VALID [2022-02-20 19:50:12,644 INFO L290 TraceCheckUtils]: 77: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,644 INFO L290 TraceCheckUtils]: 78: Hoare triple {19445#false} assume !(0 != ~mode6~0 % 256); {19445#false} is VALID [2022-02-20 19:50:12,644 INFO L290 TraceCheckUtils]: 79: Hoare triple {19445#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {19445#false} assume !(0 != ~mode7~0 % 256); {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 83: Hoare triple {19445#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 84: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 85: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,645 INFO L290 TraceCheckUtils]: 86: Hoare triple {19445#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {19445#false} is VALID [2022-02-20 19:50:12,646 INFO L290 TraceCheckUtils]: 87: Hoare triple {19445#false} check_#res#1 := check_~tmp~1#1; {19445#false} is VALID [2022-02-20 19:50:12,646 INFO L290 TraceCheckUtils]: 88: Hoare triple {19445#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; {19445#false} is VALID [2022-02-20 19:50:12,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {19445#false} assume 0 == assert_~arg#1 % 256; {19445#false} is VALID [2022-02-20 19:50:12,650 INFO L290 TraceCheckUtils]: 90: Hoare triple {19445#false} assume !false; {19445#false} is VALID [2022-02-20 19:50:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:12,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:12,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095631160] [2022-02-20 19:50:12,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095631160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:12,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:12,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:12,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835947519] [2022-02-20 19:50:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:12,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:12,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:12,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:12,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:12,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:12,712 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:50:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:14,550 INFO L93 Difference]: Finished difference Result 2510 states and 3935 transitions. [2022-02-20 19:50:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:14,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:15,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:16,138 INFO L225 Difference]: With dead ends: 2510 [2022-02-20 19:50:16,139 INFO L226 Difference]: Without dead ends: 2442 [2022-02-20 19:50:16,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:16,140 INFO L933 BasicCegarLoop]: 1697 mSDtfsCounter, 1537 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:16,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1803 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2022-02-20 19:50:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2022-02-20 19:50:16,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:16,189 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:50:16,191 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:50:16,193 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:50:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:16,337 INFO L93 Difference]: Finished difference Result 2442 states and 3826 transitions. [2022-02-20 19:50:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3826 transitions. [2022-02-20 19:50:16,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:16,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:16,344 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:50:16,346 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:50:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:16,490 INFO L93 Difference]: Finished difference Result 2442 states and 3826 transitions. [2022-02-20 19:50:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3826 transitions. [2022-02-20 19:50:16,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:16,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:16,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:16,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:16,496 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:50:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3825 transitions. [2022-02-20 19:50:16,644 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3825 transitions. Word has length 91 [2022-02-20 19:50:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:16,644 INFO L470 AbstractCegarLoop]: Abstraction has 2440 states and 3825 transitions. [2022-02-20 19:50:16,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3825 transitions. [2022-02-20 19:50:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:16,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:16,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:16,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:50:16,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1564953708, now seen corresponding path program 1 times [2022-02-20 19:50:16,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:16,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182844678] [2022-02-20 19:50:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:16,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {29365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29365#true} is VALID [2022-02-20 19:50:16,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {29365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {29365#true} is VALID [2022-02-20 19:50:16,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {29365#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {29365#true} assume 0 == ~r1~0; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {29365#true} assume ~id1~0 >= 0; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {29365#true} assume 0 == ~st1~0; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {29365#true} assume ~send1~0 == ~id1~0; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {29365#true} assume 0 == ~mode1~0 % 256; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {29365#true} assume ~id2~0 >= 0; {29365#true} is VALID [2022-02-20 19:50:16,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {29365#true} assume 0 == ~st2~0; {29365#true} is VALID [2022-02-20 19:50:16,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {29365#true} assume ~send2~0 == ~id2~0; {29365#true} is VALID [2022-02-20 19:50:16,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {29365#true} assume 0 == ~mode2~0 % 256; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {29367#(= (+ (* (- 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; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {29367#(= (+ (* (- 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; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,737 INFO L290 TraceCheckUtils]: 58: Hoare triple {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {29367#(= (+ (* (- 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; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {29367#(= (+ (* (- 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; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {29367#(= (+ (* (- 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; {29367#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:16,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {29367#(= (+ (* (- 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; {29366#false} is VALID [2022-02-20 19:50:16,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {29366#false} assume !(node2_~m2~0#1 != ~nomsg~0); {29366#false} is VALID [2022-02-20 19:50:16,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {29366#false} ~mode2~0 := 0; {29366#false} is VALID [2022-02-20 19:50:16,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {29366#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29366#false} is VALID [2022-02-20 19:50:16,740 INFO L290 TraceCheckUtils]: 67: Hoare triple {29366#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29366#false} is VALID [2022-02-20 19:50:16,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {29366#false} ~mode3~0 := 0; {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {29366#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {29366#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {29366#false} ~mode4~0 := 0; {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {29366#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 75: Hoare triple {29366#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29366#false} is VALID [2022-02-20 19:50:16,741 INFO L290 TraceCheckUtils]: 76: Hoare triple {29366#false} ~mode5~0 := 0; {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 77: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {29366#false} assume !(0 != ~mode6~0 % 256); {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {29366#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 81: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {29366#false} assume !(0 != ~mode7~0 % 256); {29366#false} is VALID [2022-02-20 19:50:16,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {29366#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 84: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {29366#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {29366#false} check_#res#1 := check_~tmp~1#1; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 88: Hoare triple {29366#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; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 89: Hoare triple {29366#false} assume 0 == assert_~arg#1 % 256; {29366#false} is VALID [2022-02-20 19:50:16,743 INFO L290 TraceCheckUtils]: 90: Hoare triple {29366#false} assume !false; {29366#false} is VALID [2022-02-20 19:50:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:16,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:16,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182844678] [2022-02-20 19:50:16,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182844678] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:16,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:16,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:16,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198503831] [2022-02-20 19:50:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:16,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:16,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:16,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:16,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:16,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:16,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:16,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:16,804 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:50:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:18,751 INFO L93 Difference]: Finished difference Result 2684 states and 4213 transitions. [2022-02-20 19:50:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:18,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:20,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:20,325 INFO L225 Difference]: With dead ends: 2684 [2022-02-20 19:50:20,325 INFO L226 Difference]: Without dead ends: 2556 [2022-02-20 19:50:20,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:20,326 INFO L933 BasicCegarLoop]: 1692 mSDtfsCounter, 1533 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:20,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1802 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-02-20 19:50:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2554. [2022-02-20 19:50:20,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:20,393 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:50:20,395 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:50:20,398 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:50:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:20,550 INFO L93 Difference]: Finished difference Result 2556 states and 4007 transitions. [2022-02-20 19:50:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4007 transitions. [2022-02-20 19:50:20,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:20,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:20,557 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:50:20,559 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:50:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:20,719 INFO L93 Difference]: Finished difference Result 2556 states and 4007 transitions. [2022-02-20 19:50:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4007 transitions. [2022-02-20 19:50:20,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:20,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:20,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:20,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:20,724 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:50:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4006 transitions. [2022-02-20 19:50:20,890 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4006 transitions. Word has length 91 [2022-02-20 19:50:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:20,890 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4006 transitions. [2022-02-20 19:50:20,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4006 transitions. [2022-02-20 19:50:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:20,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:20,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:20,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:50:20,891 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1479108296, now seen corresponding path program 1 times [2022-02-20 19:50:20,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:20,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699551591] [2022-02-20 19:50:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:20,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {39852#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {39852#true} is VALID [2022-02-20 19:50:20,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {39852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {39852#true} is VALID [2022-02-20 19:50:20,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {39852#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39852#true} is VALID [2022-02-20 19:50:20,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {39852#true} assume 0 == ~r1~0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {39852#true} assume ~id1~0 >= 0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {39852#true} assume 0 == ~st1~0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {39852#true} assume ~send1~0 == ~id1~0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {39852#true} assume 0 == ~mode1~0 % 256; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {39852#true} assume ~id2~0 >= 0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {39852#true} assume 0 == ~st2~0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {39852#true} assume ~send2~0 == ~id2~0; {39852#true} is VALID [2022-02-20 19:50:20,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {39852#true} assume 0 == ~mode2~0 % 256; {39852#true} is VALID [2022-02-20 19:50:20,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {39852#true} assume ~id3~0 >= 0; {39852#true} is VALID [2022-02-20 19:50:20,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {39852#true} assume 0 == ~st3~0; {39852#true} is VALID [2022-02-20 19:50:20,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {39852#true} assume ~send3~0 == ~id3~0; {39852#true} is VALID [2022-02-20 19:50:20,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {39852#true} assume 0 == ~mode3~0 % 256; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,982 INFO L290 TraceCheckUtils]: 64: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {39854#(= (+ (* (- 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; {39854#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:20,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {39854#(= (+ (* (- 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; {39853#false} is VALID [2022-02-20 19:50:20,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {39853#false} assume !(node3_~m3~0#1 != ~nomsg~0); {39853#false} is VALID [2022-02-20 19:50:20,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {39853#false} ~mode3~0 := 0; {39853#false} is VALID [2022-02-20 19:50:20,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,983 INFO L290 TraceCheckUtils]: 70: Hoare triple {39853#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {39853#false} assume !(node4_~m4~0#1 != ~nomsg~0); {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 72: Hoare triple {39853#false} ~mode4~0 := 0; {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 73: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 74: Hoare triple {39853#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 75: Hoare triple {39853#false} assume !(node5_~m5~0#1 != ~nomsg~0); {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {39853#false} ~mode5~0 := 0; {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 77: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {39853#false} assume !(0 != ~mode6~0 % 256); {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 79: Hoare triple {39853#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 80: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {39853#false} assume !(0 != ~mode7~0 % 256); {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {39853#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 84: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 85: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {39853#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {39853#false} is VALID [2022-02-20 19:50:20,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {39853#false} check_#res#1 := check_~tmp~1#1; {39853#false} is VALID [2022-02-20 19:50:20,986 INFO L290 TraceCheckUtils]: 88: Hoare triple {39853#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; {39853#false} is VALID [2022-02-20 19:50:20,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {39853#false} assume 0 == assert_~arg#1 % 256; {39853#false} is VALID [2022-02-20 19:50:20,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {39853#false} assume !false; {39853#false} is VALID [2022-02-20 19:50:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:20,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:20,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699551591] [2022-02-20 19:50:20,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699551591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:20,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:20,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:20,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43335610] [2022-02-20 19:50:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:20,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:20,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:20,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:21,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:21,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:21,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:21,042 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:50:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:22,972 INFO L93 Difference]: Finished difference Result 3014 states and 4736 transitions. [2022-02-20 19:50:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:22,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:24,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:24,614 INFO L225 Difference]: With dead ends: 3014 [2022-02-20 19:50:24,614 INFO L226 Difference]: Without dead ends: 2772 [2022-02-20 19:50:24,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:24,616 INFO L933 BasicCegarLoop]: 1687 mSDtfsCounter, 1529 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:24,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1801 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2022-02-20 19:50:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2770. [2022-02-20 19:50:24,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:24,714 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:50:24,716 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:50:24,717 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:50:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:24,915 INFO L93 Difference]: Finished difference Result 2772 states and 4347 transitions. [2022-02-20 19:50:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4347 transitions. [2022-02-20 19:50:24,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:24,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:24,921 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:50:24,922 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:50:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:25,147 INFO L93 Difference]: Finished difference Result 2772 states and 4347 transitions. [2022-02-20 19:50:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4347 transitions. [2022-02-20 19:50:25,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:25,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:25,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:25,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:25,153 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:50:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 4346 transitions. [2022-02-20 19:50:25,366 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 4346 transitions. Word has length 91 [2022-02-20 19:50:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:25,366 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 4346 transitions. [2022-02-20 19:50:25,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 4346 transitions. [2022-02-20 19:50:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:25,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:25,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:25,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:50:25,368 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 733525566, now seen corresponding path program 1 times [2022-02-20 19:50:25,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:25,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848666586] [2022-02-20 19:50:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:25,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {51417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {51417#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {51417#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {51417#true} assume 0 == ~r1~0; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {51417#true} assume ~id1~0 >= 0; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {51417#true} assume 0 == ~st1~0; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {51417#true} assume ~send1~0 == ~id1~0; {51417#true} is VALID [2022-02-20 19:50:25,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {51417#true} assume 0 == ~mode1~0 % 256; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {51417#true} assume ~id2~0 >= 0; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {51417#true} assume 0 == ~st2~0; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {51417#true} assume ~send2~0 == ~id2~0; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {51417#true} assume 0 == ~mode2~0 % 256; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {51417#true} assume ~id3~0 >= 0; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {51417#true} assume 0 == ~st3~0; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {51417#true} assume ~send3~0 == ~id3~0; {51417#true} is VALID [2022-02-20 19:50:25,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {51417#true} assume 0 == ~mode3~0 % 256; {51417#true} is VALID [2022-02-20 19:50:25,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {51417#true} assume ~id4~0 >= 0; {51417#true} is VALID [2022-02-20 19:50:25,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {51417#true} assume 0 == ~st4~0; {51417#true} is VALID [2022-02-20 19:50:25,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {51417#true} assume ~send4~0 == ~id4~0; {51417#true} is VALID [2022-02-20 19:50:25,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {51417#true} assume 0 == ~mode4~0 % 256; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {51419#(= (+ (* (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; {51419#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:25,458 INFO L290 TraceCheckUtils]: 70: Hoare triple {51419#(= (+ (* (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; {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {51418#false} assume !(node4_~m4~0#1 != ~nomsg~0); {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 72: Hoare triple {51418#false} ~mode4~0 := 0; {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 73: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {51418#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 75: Hoare triple {51418#false} assume !(node5_~m5~0#1 != ~nomsg~0); {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {51418#false} ~mode5~0 := 0; {51418#false} is VALID [2022-02-20 19:50:25,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {51418#false} assume !(0 != ~mode6~0 % 256); {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 79: Hoare triple {51418#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 80: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 81: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 82: Hoare triple {51418#false} assume !(0 != ~mode7~0 % 256); {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 83: Hoare triple {51418#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 84: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,461 INFO L290 TraceCheckUtils]: 86: Hoare triple {51418#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {51418#false} is VALID [2022-02-20 19:50:25,461 INFO L290 TraceCheckUtils]: 87: Hoare triple {51418#false} check_#res#1 := check_~tmp~1#1; {51418#false} is VALID [2022-02-20 19:50:25,461 INFO L290 TraceCheckUtils]: 88: Hoare triple {51418#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; {51418#false} is VALID [2022-02-20 19:50:25,461 INFO L290 TraceCheckUtils]: 89: Hoare triple {51418#false} assume 0 == assert_~arg#1 % 256; {51418#false} is VALID [2022-02-20 19:50:25,461 INFO L290 TraceCheckUtils]: 90: Hoare triple {51418#false} assume !false; {51418#false} is VALID [2022-02-20 19:50:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:25,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:25,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848666586] [2022-02-20 19:50:25,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848666586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:25,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:25,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:25,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892766171] [2022-02-20 19:50:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:25,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:25,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:25,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:25,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:25,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:25,528 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:50:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:27,764 INFO L93 Difference]: Finished difference Result 3638 states and 5716 transitions. [2022-02-20 19:50:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:27,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:27,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:29,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:29,494 INFO L225 Difference]: With dead ends: 3638 [2022-02-20 19:50:29,494 INFO L226 Difference]: Without dead ends: 3180 [2022-02-20 19:50:29,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:29,495 INFO L933 BasicCegarLoop]: 1682 mSDtfsCounter, 1525 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:29,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1525 Valid, 1800 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-02-20 19:50:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3178. [2022-02-20 19:50:29,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:29,661 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:50:29,662 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:50:29,664 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:50:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:29,950 INFO L93 Difference]: Finished difference Result 3180 states and 4983 transitions. [2022-02-20 19:50:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4983 transitions. [2022-02-20 19:50:29,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:29,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:29,955 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:50:29,957 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:50:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:30,239 INFO L93 Difference]: Finished difference Result 3180 states and 4983 transitions. [2022-02-20 19:50:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4983 transitions. [2022-02-20 19:50:30,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:30,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:30,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:30,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:30,245 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:50:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4982 transitions. [2022-02-20 19:50:30,565 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4982 transitions. Word has length 91 [2022-02-20 19:50:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:30,565 INFO L470 AbstractCegarLoop]: Abstraction has 3178 states and 4982 transitions. [2022-02-20 19:50:30,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4982 transitions. [2022-02-20 19:50:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:30,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:30,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:50:30,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:50:30,567 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1206505292, now seen corresponding path program 1 times [2022-02-20 19:50:30,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:30,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918417492] [2022-02-20 19:50:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:30,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {65030#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {65030#true} is VALID [2022-02-20 19:50:30,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {65030#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {65030#true} is VALID [2022-02-20 19:50:30,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {65030#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {65030#true} is VALID [2022-02-20 19:50:30,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {65030#true} assume 0 == ~r1~0; {65030#true} is VALID [2022-02-20 19:50:30,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {65030#true} assume ~id1~0 >= 0; {65030#true} is VALID [2022-02-20 19:50:30,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {65030#true} assume 0 == ~st1~0; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {65030#true} assume ~send1~0 == ~id1~0; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {65030#true} assume 0 == ~mode1~0 % 256; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {65030#true} assume ~id2~0 >= 0; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {65030#true} assume 0 == ~st2~0; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {65030#true} assume ~send2~0 == ~id2~0; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {65030#true} assume 0 == ~mode2~0 % 256; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {65030#true} assume ~id3~0 >= 0; {65030#true} is VALID [2022-02-20 19:50:30,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {65030#true} assume 0 == ~st3~0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {65030#true} assume ~send3~0 == ~id3~0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {65030#true} assume 0 == ~mode3~0 % 256; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {65030#true} assume ~id4~0 >= 0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {65030#true} assume 0 == ~st4~0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {65030#true} assume ~send4~0 == ~id4~0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {65030#true} assume 0 == ~mode4~0 % 256; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {65030#true} assume ~id5~0 >= 0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {65030#true} assume 0 == ~st5~0; {65030#true} is VALID [2022-02-20 19:50:30,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {65030#true} assume ~send5~0 == ~id5~0; {65030#true} is VALID [2022-02-20 19:50:30,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {65030#true} assume 0 == ~mode5~0 % 256; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,638 INFO L290 TraceCheckUtils]: 55: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,640 INFO L290 TraceCheckUtils]: 62: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,644 INFO L290 TraceCheckUtils]: 72: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {65032#(= (+ (* (- 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; {65032#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:30,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {65032#(= (+ (* (- 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; {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {65031#false} assume !(node5_~m5~0#1 != ~nomsg~0); {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {65031#false} ~mode5~0 := 0; {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {65031#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; {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {65031#false} assume !(0 != ~mode6~0 % 256); {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {65031#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {65031#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; {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {65031#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; {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {65031#false} assume !(0 != ~mode7~0 % 256); {65031#false} is VALID [2022-02-20 19:50:30,645 INFO L290 TraceCheckUtils]: 83: Hoare triple {65031#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {65031#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; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 85: Hoare triple {65031#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; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 86: Hoare triple {65031#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 87: Hoare triple {65031#false} check_#res#1 := check_~tmp~1#1; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 88: Hoare triple {65031#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; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 89: Hoare triple {65031#false} assume 0 == assert_~arg#1 % 256; {65031#false} is VALID [2022-02-20 19:50:30,646 INFO L290 TraceCheckUtils]: 90: Hoare triple {65031#false} assume !false; {65031#false} is VALID [2022-02-20 19:50:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:30,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:30,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918417492] [2022-02-20 19:50:30,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918417492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:30,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:30,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:30,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823409210] [2022-02-20 19:50:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:30,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:30,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:30,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:30,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:30,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:30,704 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:50:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:33,264 INFO L93 Difference]: Finished difference Result 4814 states and 7544 transitions. [2022-02-20 19:50:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:50:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:33,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:34,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:35,137 INFO L225 Difference]: With dead ends: 4814 [2022-02-20 19:50:35,137 INFO L226 Difference]: Without dead ends: 3948 [2022-02-20 19:50:35,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:35,141 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:35,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 1799 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2022-02-20 19:50:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3946. [2022-02-20 19:50:35,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:35,497 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:50:35,499 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:50:35,501 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:50:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:35,893 INFO L93 Difference]: Finished difference Result 3948 states and 6167 transitions. [2022-02-20 19:50:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 6167 transitions. [2022-02-20 19:50:35,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:35,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:35,901 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:50:35,903 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.