./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f21ea595eac4353ca417fd812da6cdd2e6031060e3844060c8f8fe5fbe20b17 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:50:53,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:50:53,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:50:53,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:50:53,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:50:53,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:50:53,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:50:53,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:50:53,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:50:53,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:50:53,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:50:53,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:50:53,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:50:53,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:50:53,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:50:53,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:50:53,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:50:53,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:50:53,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:50:53,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:50:53,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:50:53,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:50:53,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:50:53,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:50:53,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:50:53,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:50:53,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:50:53,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:50:53,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:50:53,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:50:53,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:50:53,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:50:53,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:50:53,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:50:53,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:50:53,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:50:53,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:50:53,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:50:53,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:50:53,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:50:53,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:50:53,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:50:53,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:50:53,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:50:53,234 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:50:53,234 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:50:53,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:50:53,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:50:53,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:50:53,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:50:53,235 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:50:53,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:50:53,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:50:53,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:50:53,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:50:53,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:50:53,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:50:53,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:50:53,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:50:53,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:50:53,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:53,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:50:53,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:50:53,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:50:53,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:50:53,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:50:53,238 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:50:53,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:50:53,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:50:53,239 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 -> 7f21ea595eac4353ca417fd812da6cdd2e6031060e3844060c8f8fe5fbe20b17 [2022-02-20 19:50:53,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:50:53,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:50:53,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:50:53,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:50:53,431 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:50:53,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:50:53,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81975df25/12058111a19940f68ad99e3eb34c4bb7/FLAG1315912fe [2022-02-20 19:50:54,023 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:50:54,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:50:54,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81975df25/12058111a19940f68ad99e3eb34c4bb7/FLAG1315912fe [2022-02-20 19:50:54,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81975df25/12058111a19940f68ad99e3eb34c4bb7 [2022-02-20 19:50:54,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:50:54,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:50:54,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:54,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:50:54,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:50:54,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:54" (1/1) ... [2022-02-20 19:50:54,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b558358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:54, skipping insertion in model container [2022-02-20 19:50:54,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:54" (1/1) ... [2022-02-20 19:50:54,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:50:54,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:50:54,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c[20454,20467] [2022-02-20 19:50:54,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c[23961,23974] [2022-02-20 19:50:55,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:55,489 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:50:55,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c[20454,20467] [2022-02-20 19:50:55,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c[23961,23974] [2022-02-20 19:50:55,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:55,866 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:50:55,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55 WrapperNode [2022-02-20 19:50:55,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:55,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:55,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:50:55,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:50:55,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:55,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,298 INFO L137 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5208 [2022-02-20 19:50:56,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:56,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:50:56,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:50:56,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:50:56,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:50:56,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:50:56,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:50:56,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:50:56,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (1/1) ... [2022-02-20 19:50:56,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:56,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:50:56,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:50:56,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:50:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:50:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:50:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:50:56,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:50:56,831 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:50:56,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:51:03,528 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:51:03,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:51:03,540 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:51:03,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:51:03 BoogieIcfgContainer [2022-02-20 19:51:03,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:51:03,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:51:03,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:51:03,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:51:03,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:50:54" (1/3) ... [2022-02-20 19:51:03,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e2b1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:51:03, skipping insertion in model container [2022-02-20 19:51:03,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:55" (2/3) ... [2022-02-20 19:51:03,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e2b1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:51:03, skipping insertion in model container [2022-02-20 19:51:03,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:51:03" (3/3) ... [2022-02-20 19:51:03,549 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c [2022-02-20 19:51:03,552 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:51:03,553 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:51:03,586 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:51:03,590 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:51:03,590 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:51:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:51:03,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:03,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:03,629 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -677744851, now seen corresponding path program 1 times [2022-02-20 19:51:03,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:03,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641176779] [2022-02-20 19:51:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:03,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(<= 13 ~a7~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#(<= 13 ~a7~0)} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {951#(<= 13 ~a7~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {951#(<= 13 ~a7~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {951#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {951#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {951#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {951#(<= 13 ~a7~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {951#(<= 13 ~a7~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {951#(<= 13 ~a7~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= 13 ~a7~0)} is VALID [2022-02-20 19:51:03,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {951#(<= 13 ~a7~0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {950#false} is VALID [2022-02-20 19:51:03,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-02-20 19:51:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:03,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:03,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641176779] [2022-02-20 19:51:03,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641176779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:03,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:03,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:51:03,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062687132] [2022-02-20 19:51:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:51:03,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:03,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:03,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:03,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:03,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:03,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:03,897 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:09,467 INFO L93 Difference]: Finished difference Result 2589 states and 4970 transitions. [2022-02-20 19:51:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:09,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 19:51:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4970 transitions. [2022-02-20 19:51:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4970 transitions. [2022-02-20 19:51:09,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4970 transitions. [2022-02-20 19:51:12,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4970 edges. 4970 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:13,096 INFO L225 Difference]: With dead ends: 2589 [2022-02-20 19:51:13,097 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:51:13,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:13,108 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 1024 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:13,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 331 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 19:51:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:51:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:51:13,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:13,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8569674647022714) internal successors, (3025), 1630 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:13,204 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8569674647022714) internal successors, (3025), 1630 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:13,208 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8569674647022714) internal successors, (3025), 1630 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:13,296 INFO L93 Difference]: Finished difference Result 1631 states and 3025 transitions. [2022-02-20 19:51:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3025 transitions. [2022-02-20 19:51:13,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:13,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:13,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.8569674647022714) internal successors, (3025), 1630 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1631 states. [2022-02-20 19:51:13,312 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.8569674647022714) internal successors, (3025), 1630 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1631 states. [2022-02-20 19:51:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:13,403 INFO L93 Difference]: Finished difference Result 1631 states and 3025 transitions. [2022-02-20 19:51:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3025 transitions. [2022-02-20 19:51:13,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:13,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:13,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:13,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.8569674647022714) internal successors, (3025), 1630 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3025 transitions. [2022-02-20 19:51:13,502 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3025 transitions. Word has length 30 [2022-02-20 19:51:13,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:13,506 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 3025 transitions. [2022-02-20 19:51:13,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3025 transitions. [2022-02-20 19:51:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:51:13,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:13,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:13,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:51:13,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1343709944, now seen corresponding path program 1 times [2022-02-20 19:51:13,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:13,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408927355] [2022-02-20 19:51:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:13,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {8497#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8497#true} is VALID [2022-02-20 19:51:13,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {8497#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {8497#true} is VALID [2022-02-20 19:51:13,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {8497#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8497#true} is VALID [2022-02-20 19:51:13,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {8497#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8499#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:51:13,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {8499#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8500#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:51:13,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {8500#(= |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; {8501#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:51:13,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {8501#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8498#false} is VALID [2022-02-20 19:51:13,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {8498#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8498#false} is VALID [2022-02-20 19:51:13,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {8498#false} assume !(0 != ~mode1~0 % 256); {8498#false} is VALID [2022-02-20 19:51:13,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {8498#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8498#false} is VALID [2022-02-20 19:51:13,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {8498#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8498#false} is VALID [2022-02-20 19:51:13,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {8498#false} assume !(0 != ~mode2~0 % 256); {8498#false} is VALID [2022-02-20 19:51:13,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {8498#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8498#false} is VALID [2022-02-20 19:51:13,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {8498#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8498#false} is VALID [2022-02-20 19:51:13,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {8498#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8498#false} is VALID [2022-02-20 19:51:13,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {8498#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8498#false} is VALID [2022-02-20 19:51:13,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {8498#false} ~mode3~0 := 0; {8498#false} is VALID [2022-02-20 19:51:13,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {8498#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8498#false} is VALID [2022-02-20 19:51:13,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {8498#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8498#false} is VALID [2022-02-20 19:51:13,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {8498#false} ~mode4~0 := 0; {8498#false} is VALID [2022-02-20 19:51:13,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {8498#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8498#false} is VALID [2022-02-20 19:51:13,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {8498#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8498#false} is VALID [2022-02-20 19:51:13,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {8498#false} ~mode5~0 := 0; {8498#false} is VALID [2022-02-20 19:51:13,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {8498#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8498#false} is VALID [2022-02-20 19:51:13,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {8498#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8498#false} is VALID [2022-02-20 19:51:13,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {8498#false} ~mode6~0 := 0; {8498#false} is VALID [2022-02-20 19:51:13,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {8498#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8498#false} is VALID [2022-02-20 19:51:13,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {8498#false} assume !(node7_~m7~0#1 != ~nomsg~0); {8498#false} is VALID [2022-02-20 19:51:13,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {8498#false} ~mode7~0 := 0; {8498#false} is VALID [2022-02-20 19:51:13,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {8498#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {8498#false} is VALID [2022-02-20 19:51:13,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {8498#false} check_#res#1 := check_~tmp~1#1; {8498#false} is VALID [2022-02-20 19:51:13,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {8498#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; {8498#false} is VALID [2022-02-20 19:51:13,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {8498#false} assume 0 == assert_~arg#1 % 256; {8498#false} is VALID [2022-02-20 19:51:13,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {8498#false} assume !false; {8498#false} is VALID [2022-02-20 19:51:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:13,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:13,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408927355] [2022-02-20 19:51:13,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408927355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:13,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:13,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:51:13,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063518449] [2022-02-20 19:51:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:13,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:51:13,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:13,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:13,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:13,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:51:13,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:51:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:51:13,676 INFO L87 Difference]: Start difference. First operand 1631 states and 3025 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:17,566 INFO L93 Difference]: Finished difference Result 1705 states and 3140 transitions. [2022-02-20 19:51:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:51:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 19:51:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:51:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:51:17,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1771 transitions. [2022-02-20 19:51:18,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1771 edges. 1771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:18,983 INFO L225 Difference]: With dead ends: 1705 [2022-02-20 19:51:18,983 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:51:18,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:51:18,985 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 3 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:18,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6563 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:51:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:51:19,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:19,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8262737875997546) internal successors, (2975), 1630 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:19,017 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8262737875997546) internal successors, (2975), 1630 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:19,019 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.8262737875997546) internal successors, (2975), 1630 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:19,102 INFO L93 Difference]: Finished difference Result 1631 states and 2975 transitions. [2022-02-20 19:51:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2975 transitions. [2022-02-20 19:51:19,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:19,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:19,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.8262737875997546) internal successors, (2975), 1630 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1631 states. [2022-02-20 19:51:19,110 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.8262737875997546) internal successors, (2975), 1630 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1631 states. [2022-02-20 19:51:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:19,191 INFO L93 Difference]: Finished difference Result 1631 states and 2975 transitions. [2022-02-20 19:51:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2975 transitions. [2022-02-20 19:51:19,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:19,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:19,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:19,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.8262737875997546) internal successors, (2975), 1630 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2975 transitions. [2022-02-20 19:51:19,284 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2975 transitions. Word has length 42 [2022-02-20 19:51:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:19,285 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2975 transitions. [2022-02-20 19:51:19,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2975 transitions. [2022-02-20 19:51:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:19,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:19,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:19,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:51:19,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:19,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -461668761, now seen corresponding path program 1 times [2022-02-20 19:51:19,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:19,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226869817] [2022-02-20 19:51:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:19,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {15159#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15159#true} is VALID [2022-02-20 19:51:19,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {15159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {15159#true} is VALID [2022-02-20 19:51:19,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {15159#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15159#true} is VALID [2022-02-20 19:51:19,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {15159#true} assume 0 == ~r1~0 % 256; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {15159#true} assume ~id1~0 >= 0; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {15159#true} assume 0 == ~st1~0; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {15159#true} assume ~send1~0 == ~id1~0; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {15159#true} assume 0 == ~mode1~0 % 256; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {15159#true} assume ~id2~0 >= 0; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {15159#true} assume 0 == ~st2~0; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {15159#true} assume ~send2~0 == ~id2~0; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {15159#true} assume 0 == ~mode2~0 % 256; {15159#true} is VALID [2022-02-20 19:51:19,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {15159#true} assume ~id3~0 >= 0; {15159#true} is VALID [2022-02-20 19:51:19,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {15159#true} assume 0 == ~st3~0; {15159#true} is VALID [2022-02-20 19:51:19,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {15159#true} assume ~send3~0 == ~id3~0; {15159#true} is VALID [2022-02-20 19:51:19,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {15159#true} assume 0 == ~mode3~0 % 256; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {15161#(= (+ (* (- 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; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,455 INFO L290 TraceCheckUtils]: 55: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {15161#(= (+ (* (- 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; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {15161#(= (+ (* (- 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; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {15161#(= (+ (* (- 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; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {15161#(= (+ (* (- 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; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {15161#(= (+ (* (- 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; {15161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {15161#(= (+ (* (- 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; {15160#false} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {15160#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15160#false} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {15160#false} ~mode3~0 := 0; {15160#false} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {15160#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; {15160#false} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {15160#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15160#false} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {15160#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15160#false} is VALID [2022-02-20 19:51:19,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {15160#false} ~mode4~0 := 0; {15160#false} is VALID [2022-02-20 19:51:19,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {15160#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; {15160#false} is VALID [2022-02-20 19:51:19,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {15160#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15160#false} is VALID [2022-02-20 19:51:19,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {15160#false} assume !(node5_~m5~0#1 != ~nomsg~0); {15160#false} is VALID [2022-02-20 19:51:19,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {15160#false} ~mode5~0 := 0; {15160#false} is VALID [2022-02-20 19:51:19,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {15160#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; {15160#false} is VALID [2022-02-20 19:51:19,461 INFO L290 TraceCheckUtils]: 78: Hoare triple {15160#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {15160#false} assume !(node6_~m6~0#1 != ~nomsg~0); {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {15160#false} ~mode6~0 := 0; {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 81: Hoare triple {15160#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; {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {15160#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {15160#false} assume !(node7_~m7~0#1 != ~nomsg~0); {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {15160#false} ~mode7~0 := 0; {15160#false} is VALID [2022-02-20 19:51:19,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {15160#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; {15160#false} is VALID [2022-02-20 19:51:19,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {15160#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {15160#false} is VALID [2022-02-20 19:51:19,463 INFO L290 TraceCheckUtils]: 87: Hoare triple {15160#false} check_#res#1 := check_~tmp~1#1; {15160#false} is VALID [2022-02-20 19:51:19,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {15160#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; {15160#false} is VALID [2022-02-20 19:51:19,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {15160#false} assume 0 == assert_~arg#1 % 256; {15160#false} is VALID [2022-02-20 19:51:19,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {15160#false} assume !false; {15160#false} is VALID [2022-02-20 19:51:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:19,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:19,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226869817] [2022-02-20 19:51:19,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226869817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:19,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:19,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:19,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609322825] [2022-02-20 19:51:19,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:19,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:19,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:19,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:19,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:19,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:19,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:19,518 INFO L87 Difference]: Start difference. First operand 1631 states and 2975 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:21,228 INFO L93 Difference]: Finished difference Result 1765 states and 3187 transitions. [2022-02-20 19:51:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:21,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:22,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:22,830 INFO L225 Difference]: With dead ends: 1765 [2022-02-20 19:51:22,830 INFO L226 Difference]: Without dead ends: 1695 [2022-02-20 19:51:22,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:22,831 INFO L933 BasicCegarLoop]: 1674 mSDtfsCounter, 1532 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:22,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 1791 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-02-20 19:51:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2022-02-20 19:51:22,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:22,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.81785925487877) internal successors, (3074), 1692 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:22,870 INFO L74 IsIncluded]: Start isIncluded. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.81785925487877) internal successors, (3074), 1692 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:22,872 INFO L87 Difference]: Start difference. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.81785925487877) internal successors, (3074), 1692 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:22,954 INFO L93 Difference]: Finished difference Result 1695 states and 3075 transitions. [2022-02-20 19:51:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3075 transitions. [2022-02-20 19:51:22,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:22,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:22,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 1693 states, 1691 states have (on average 1.81785925487877) internal successors, (3074), 1692 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1695 states. [2022-02-20 19:51:22,962 INFO L87 Difference]: Start difference. First operand has 1693 states, 1691 states have (on average 1.81785925487877) internal successors, (3074), 1692 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1695 states. [2022-02-20 19:51:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:23,049 INFO L93 Difference]: Finished difference Result 1695 states and 3075 transitions. [2022-02-20 19:51:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3075 transitions. [2022-02-20 19:51:23,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:23,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:23,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:23,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.81785925487877) internal successors, (3074), 1692 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3074 transitions. [2022-02-20 19:51:23,148 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3074 transitions. Word has length 91 [2022-02-20 19:51:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:23,150 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 3074 transitions. [2022-02-20 19:51:23,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3074 transitions. [2022-02-20 19:51:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:23,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:23,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:23,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:51:23,152 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1207251491, now seen corresponding path program 1 times [2022-02-20 19:51:23,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:23,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819342415] [2022-02-20 19:51:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:23,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {22084#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22084#true} is VALID [2022-02-20 19:51:23,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {22084#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {22084#true} is VALID [2022-02-20 19:51:23,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {22084#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22084#true} is VALID [2022-02-20 19:51:23,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {22084#true} assume 0 == ~r1~0 % 256; {22084#true} is VALID [2022-02-20 19:51:23,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {22084#true} assume ~id1~0 >= 0; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {22084#true} assume 0 == ~st1~0; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {22084#true} assume ~send1~0 == ~id1~0; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {22084#true} assume 0 == ~mode1~0 % 256; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {22084#true} assume ~id2~0 >= 0; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {22084#true} assume 0 == ~st2~0; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {22084#true} assume ~send2~0 == ~id2~0; {22084#true} is VALID [2022-02-20 19:51:23,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {22084#true} assume 0 == ~mode2~0 % 256; {22084#true} is VALID [2022-02-20 19:51:23,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {22084#true} assume ~id3~0 >= 0; {22084#true} is VALID [2022-02-20 19:51:23,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {22084#true} assume 0 == ~st3~0; {22084#true} is VALID [2022-02-20 19:51:23,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {22084#true} assume ~send3~0 == ~id3~0; {22084#true} is VALID [2022-02-20 19:51:23,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {22084#true} assume 0 == ~mode3~0 % 256; {22084#true} is VALID [2022-02-20 19:51:23,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {22084#true} assume ~id4~0 >= 0; {22084#true} is VALID [2022-02-20 19:51:23,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {22084#true} assume 0 == ~st4~0; {22084#true} is VALID [2022-02-20 19:51:23,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {22084#true} assume ~send4~0 == ~id4~0; {22084#true} is VALID [2022-02-20 19:51:23,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {22084#true} assume 0 == ~mode4~0 % 256; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,266 INFO L290 TraceCheckUtils]: 63: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {22086#(= (+ (* (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; {22086#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:23,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {22086#(= (+ (* (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; {22085#false} is VALID [2022-02-20 19:51:23,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {22085#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22085#false} is VALID [2022-02-20 19:51:23,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {22085#false} ~mode4~0 := 0; {22085#false} is VALID [2022-02-20 19:51:23,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {22085#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; {22085#false} is VALID [2022-02-20 19:51:23,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {22085#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22085#false} is VALID [2022-02-20 19:51:23,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {22085#false} assume !(node5_~m5~0#1 != ~nomsg~0); {22085#false} is VALID [2022-02-20 19:51:23,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {22085#false} ~mode5~0 := 0; {22085#false} is VALID [2022-02-20 19:51:23,270 INFO L290 TraceCheckUtils]: 77: Hoare triple {22085#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; {22085#false} is VALID [2022-02-20 19:51:23,270 INFO L290 TraceCheckUtils]: 78: Hoare triple {22085#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {22085#false} is VALID [2022-02-20 19:51:23,270 INFO L290 TraceCheckUtils]: 79: Hoare triple {22085#false} assume !(node6_~m6~0#1 != ~nomsg~0); {22085#false} is VALID [2022-02-20 19:51:23,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {22085#false} ~mode6~0 := 0; {22085#false} is VALID [2022-02-20 19:51:23,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {22085#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; {22085#false} is VALID [2022-02-20 19:51:23,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {22085#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {22085#false} is VALID [2022-02-20 19:51:23,273 INFO L290 TraceCheckUtils]: 83: Hoare triple {22085#false} assume !(node7_~m7~0#1 != ~nomsg~0); {22085#false} is VALID [2022-02-20 19:51:23,273 INFO L290 TraceCheckUtils]: 84: Hoare triple {22085#false} ~mode7~0 := 0; {22085#false} is VALID [2022-02-20 19:51:23,273 INFO L290 TraceCheckUtils]: 85: Hoare triple {22085#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; {22085#false} is VALID [2022-02-20 19:51:23,273 INFO L290 TraceCheckUtils]: 86: Hoare triple {22085#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {22085#false} is VALID [2022-02-20 19:51:23,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {22085#false} check_#res#1 := check_~tmp~1#1; {22085#false} is VALID [2022-02-20 19:51:23,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {22085#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; {22085#false} is VALID [2022-02-20 19:51:23,274 INFO L290 TraceCheckUtils]: 89: Hoare triple {22085#false} assume 0 == assert_~arg#1 % 256; {22085#false} is VALID [2022-02-20 19:51:23,274 INFO L290 TraceCheckUtils]: 90: Hoare triple {22085#false} assume !false; {22085#false} is VALID [2022-02-20 19:51:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:23,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:23,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819342415] [2022-02-20 19:51:23,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819342415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:23,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:23,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:23,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677886875] [2022-02-20 19:51:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:23,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:23,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:23,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:23,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:23,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:23,330 INFO L87 Difference]: Start difference. First operand 1693 states and 3074 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:25,019 INFO L93 Difference]: Finished difference Result 1945 states and 3474 transitions. [2022-02-20 19:51:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:25,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:26,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:26,550 INFO L225 Difference]: With dead ends: 1945 [2022-02-20 19:51:26,550 INFO L226 Difference]: Without dead ends: 1813 [2022-02-20 19:51:26,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:26,551 INFO L933 BasicCegarLoop]: 1669 mSDtfsCounter, 1528 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:26,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1790 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-02-20 19:51:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1811. [2022-02-20 19:51:26,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:26,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.802653399668325) internal successors, (3261), 1810 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,596 INFO L74 IsIncluded]: Start isIncluded. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.802653399668325) internal successors, (3261), 1810 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,598 INFO L87 Difference]: Start difference. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.802653399668325) internal successors, (3261), 1810 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:26,686 INFO L93 Difference]: Finished difference Result 1813 states and 3262 transitions. [2022-02-20 19:51:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3262 transitions. [2022-02-20 19:51:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:26,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 1811 states, 1809 states have (on average 1.802653399668325) internal successors, (3261), 1810 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1813 states. [2022-02-20 19:51:26,693 INFO L87 Difference]: Start difference. First operand has 1811 states, 1809 states have (on average 1.802653399668325) internal successors, (3261), 1810 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1813 states. [2022-02-20 19:51:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:26,787 INFO L93 Difference]: Finished difference Result 1813 states and 3262 transitions. [2022-02-20 19:51:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3262 transitions. [2022-02-20 19:51:26,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:26,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:26,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:26,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1809 states have (on average 1.802653399668325) internal successors, (3261), 1810 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 3261 transitions. [2022-02-20 19:51:26,886 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 3261 transitions. Word has length 91 [2022-02-20 19:51:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:26,886 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 3261 transitions. [2022-02-20 19:51:26,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3261 transitions. [2022-02-20 19:51:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:26,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:26,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:26,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:51:26,889 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1147684947, now seen corresponding path program 1 times [2022-02-20 19:51:26,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:26,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751643722] [2022-02-20 19:51:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:26,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {29593#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29593#true} is VALID [2022-02-20 19:51:26,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {29593#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {29593#true} is VALID [2022-02-20 19:51:26,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {29593#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29593#true} is VALID [2022-02-20 19:51:26,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {29593#true} assume 0 == ~r1~0 % 256; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {29593#true} assume ~id1~0 >= 0; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {29593#true} assume 0 == ~st1~0; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {29593#true} assume ~send1~0 == ~id1~0; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {29593#true} assume 0 == ~mode1~0 % 256; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {29593#true} assume ~id2~0 >= 0; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {29593#true} assume 0 == ~st2~0; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {29593#true} assume ~send2~0 == ~id2~0; {29593#true} is VALID [2022-02-20 19:51:26,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {29593#true} assume 0 == ~mode2~0 % 256; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {29593#true} assume ~id3~0 >= 0; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {29593#true} assume 0 == ~st3~0; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {29593#true} assume ~send3~0 == ~id3~0; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {29593#true} assume 0 == ~mode3~0 % 256; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {29593#true} assume ~id4~0 >= 0; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {29593#true} assume 0 == ~st4~0; {29593#true} is VALID [2022-02-20 19:51:26,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {29593#true} assume ~send4~0 == ~id4~0; {29593#true} is VALID [2022-02-20 19:51:26,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {29593#true} assume 0 == ~mode4~0 % 256; {29593#true} is VALID [2022-02-20 19:51:26,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {29593#true} assume ~id5~0 >= 0; {29593#true} is VALID [2022-02-20 19:51:26,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {29593#true} assume 0 == ~st5~0; {29593#true} is VALID [2022-02-20 19:51:26,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {29593#true} assume ~send5~0 == ~id5~0; {29593#true} is VALID [2022-02-20 19:51:26,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {29593#true} assume 0 == ~mode5~0 % 256; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,994 INFO L290 TraceCheckUtils]: 69: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,994 INFO L290 TraceCheckUtils]: 70: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {29595#(= (+ (* (- 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; {29595#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:26,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {29595#(= (+ (* (- 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; {29594#false} is VALID [2022-02-20 19:51:26,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {29594#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29594#false} is VALID [2022-02-20 19:51:26,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {29594#false} ~mode5~0 := 0; {29594#false} is VALID [2022-02-20 19:51:26,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {29594#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; {29594#false} is VALID [2022-02-20 19:51:26,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {29594#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {29594#false} is VALID [2022-02-20 19:51:26,996 INFO L290 TraceCheckUtils]: 79: Hoare triple {29594#false} assume !(node6_~m6~0#1 != ~nomsg~0); {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 80: Hoare triple {29594#false} ~mode6~0 := 0; {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {29594#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; {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 82: Hoare triple {29594#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 83: Hoare triple {29594#false} assume !(node7_~m7~0#1 != ~nomsg~0); {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 84: Hoare triple {29594#false} ~mode7~0 := 0; {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 85: Hoare triple {29594#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; {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {29594#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29594#false} is VALID [2022-02-20 19:51:26,997 INFO L290 TraceCheckUtils]: 87: Hoare triple {29594#false} check_#res#1 := check_~tmp~1#1; {29594#false} is VALID [2022-02-20 19:51:26,998 INFO L290 TraceCheckUtils]: 88: Hoare triple {29594#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; {29594#false} is VALID [2022-02-20 19:51:26,998 INFO L290 TraceCheckUtils]: 89: Hoare triple {29594#false} assume 0 == assert_~arg#1 % 256; {29594#false} is VALID [2022-02-20 19:51:26,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {29594#false} assume !false; {29594#false} is VALID [2022-02-20 19:51:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:27,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:27,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751643722] [2022-02-20 19:51:27,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751643722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:27,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:27,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:27,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952013092] [2022-02-20 19:51:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:27,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:27,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:27,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:27,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:27,063 INFO L87 Difference]: Start difference. First operand 1811 states and 3261 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:28,784 INFO L93 Difference]: Finished difference Result 2287 states and 4015 transitions. [2022-02-20 19:51:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:28,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:30,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:30,293 INFO L225 Difference]: With dead ends: 2287 [2022-02-20 19:51:30,293 INFO L226 Difference]: Without dead ends: 2037 [2022-02-20 19:51:30,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:30,294 INFO L933 BasicCegarLoop]: 1664 mSDtfsCounter, 1524 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:30,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-02-20 19:51:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2035. [2022-02-20 19:51:30,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:30,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.7771765863256272) internal successors, (3613), 2034 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:30,354 INFO L74 IsIncluded]: Start isIncluded. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.7771765863256272) internal successors, (3613), 2034 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:30,355 INFO L87 Difference]: Start difference. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.7771765863256272) internal successors, (3613), 2034 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:30,462 INFO L93 Difference]: Finished difference Result 2037 states and 3614 transitions. [2022-02-20 19:51:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3614 transitions. [2022-02-20 19:51:30,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:30,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:30,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 2035 states, 2033 states have (on average 1.7771765863256272) internal successors, (3613), 2034 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2037 states. [2022-02-20 19:51:30,469 INFO L87 Difference]: Start difference. First operand has 2035 states, 2033 states have (on average 1.7771765863256272) internal successors, (3613), 2034 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2037 states. [2022-02-20 19:51:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:30,582 INFO L93 Difference]: Finished difference Result 2037 states and 3614 transitions. [2022-02-20 19:51:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3614 transitions. [2022-02-20 19:51:30,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:30,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:30,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:30,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2033 states have (on average 1.7771765863256272) internal successors, (3613), 2034 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3613 transitions. [2022-02-20 19:51:30,705 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3613 transitions. Word has length 91 [2022-02-20 19:51:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:30,706 INFO L470 AbstractCegarLoop]: Abstraction has 2035 states and 3613 transitions. [2022-02-20 19:51:30,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3613 transitions. [2022-02-20 19:51:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:30,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:30,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:30,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:51:30,707 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash -446599735, now seen corresponding path program 1 times [2022-02-20 19:51:30,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:30,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381012131] [2022-02-20 19:51:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:30,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {38216#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {38216#true} is VALID [2022-02-20 19:51:30,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {38216#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {38216#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {38216#true} assume 0 == ~r1~0 % 256; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {38216#true} assume ~id1~0 >= 0; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {38216#true} assume 0 == ~st1~0; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {38216#true} assume ~send1~0 == ~id1~0; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {38216#true} assume 0 == ~mode1~0 % 256; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {38216#true} assume ~id2~0 >= 0; {38216#true} is VALID [2022-02-20 19:51:30,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {38216#true} assume 0 == ~st2~0; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {38216#true} assume ~send2~0 == ~id2~0; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {38216#true} assume 0 == ~mode2~0 % 256; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {38216#true} assume ~id3~0 >= 0; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {38216#true} assume 0 == ~st3~0; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {38216#true} assume ~send3~0 == ~id3~0; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {38216#true} assume 0 == ~mode3~0 % 256; {38216#true} is VALID [2022-02-20 19:51:30,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {38216#true} assume ~id4~0 >= 0; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {38216#true} assume 0 == ~st4~0; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {38216#true} assume ~send4~0 == ~id4~0; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {38216#true} assume 0 == ~mode4~0 % 256; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {38216#true} assume ~id5~0 >= 0; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {38216#true} assume 0 == ~st5~0; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {38216#true} assume ~send5~0 == ~id5~0; {38216#true} is VALID [2022-02-20 19:51:30,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {38216#true} assume 0 == ~mode5~0 % 256; {38216#true} is VALID [2022-02-20 19:51:30,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {38216#true} assume ~id6~0 >= 0; {38216#true} is VALID [2022-02-20 19:51:30,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {38216#true} assume 0 == ~st6~0; {38216#true} is VALID [2022-02-20 19:51:30,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {38216#true} assume ~send6~0 == ~id6~0; {38216#true} is VALID [2022-02-20 19:51:30,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {38216#true} assume 0 == ~mode6~0 % 256; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,775 INFO L290 TraceCheckUtils]: 77: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:30,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {38218#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {38217#false} is VALID [2022-02-20 19:51:30,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {38217#false} assume !(node6_~m6~0#1 != ~nomsg~0); {38217#false} is VALID [2022-02-20 19:51:30,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {38217#false} ~mode6~0 := 0; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {38217#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; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {38217#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {38217#false} assume !(node7_~m7~0#1 != ~nomsg~0); {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {38217#false} ~mode7~0 := 0; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {38217#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; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {38217#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {38217#false} check_#res#1 := check_~tmp~1#1; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {38217#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; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {38217#false} assume 0 == assert_~arg#1 % 256; {38217#false} is VALID [2022-02-20 19:51:30,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {38217#false} assume !false; {38217#false} is VALID [2022-02-20 19:51:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:30,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:30,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381012131] [2022-02-20 19:51:30,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381012131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:30,777 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:30,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:30,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707119617] [2022-02-20 19:51:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:30,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:30,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:30,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:30,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:30,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:30,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:30,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:30,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:30,831 INFO L87 Difference]: Start difference. First operand 2035 states and 3613 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:32,743 INFO L93 Difference]: Finished difference Result 2935 states and 5031 transitions. [2022-02-20 19:51:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:32,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:32,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:34,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:34,289 INFO L225 Difference]: With dead ends: 2935 [2022-02-20 19:51:34,289 INFO L226 Difference]: Without dead ends: 2461 [2022-02-20 19:51:34,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:34,292 INFO L933 BasicCegarLoop]: 1659 mSDtfsCounter, 1520 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:34,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 1788 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2022-02-20 19:51:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2459. [2022-02-20 19:51:34,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:34,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.739112739112739) internal successors, (4273), 2458 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:34,407 INFO L74 IsIncluded]: Start isIncluded. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.739112739112739) internal successors, (4273), 2458 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:34,409 INFO L87 Difference]: Start difference. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.739112739112739) internal successors, (4273), 2458 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:34,567 INFO L93 Difference]: Finished difference Result 2461 states and 4274 transitions. [2022-02-20 19:51:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4274 transitions. [2022-02-20 19:51:34,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:34,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:34,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 2459 states, 2457 states have (on average 1.739112739112739) internal successors, (4273), 2458 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2461 states. [2022-02-20 19:51:34,576 INFO L87 Difference]: Start difference. First operand has 2459 states, 2457 states have (on average 1.739112739112739) internal successors, (4273), 2458 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2461 states. [2022-02-20 19:51:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:34,728 INFO L93 Difference]: Finished difference Result 2461 states and 4274 transitions. [2022-02-20 19:51:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4274 transitions. [2022-02-20 19:51:34,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:34,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:34,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:34,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2457 states have (on average 1.739112739112739) internal successors, (4273), 2458 states have internal predecessors, (4273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4273 transitions. [2022-02-20 19:51:34,899 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4273 transitions. Word has length 91 [2022-02-20 19:51:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:34,899 INFO L470 AbstractCegarLoop]: Abstraction has 2459 states and 4273 transitions. [2022-02-20 19:51:34,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4273 transitions. [2022-02-20 19:51:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:34,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:34,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:34,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:51:34,901 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -108806593, now seen corresponding path program 1 times [2022-02-20 19:51:34,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:34,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761824005] [2022-02-20 19:51:34,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:34,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:34,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {48959#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {48959#true} is VALID [2022-02-20 19:51:34,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {48959#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {48959#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {48959#true} assume 0 == ~r1~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {48959#true} assume ~id1~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {48959#true} assume 0 == ~st1~0; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {48959#true} assume ~send1~0 == ~id1~0; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {48959#true} assume 0 == ~mode1~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {48959#true} assume ~id2~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {48959#true} assume 0 == ~st2~0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {48959#true} assume ~send2~0 == ~id2~0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {48959#true} assume 0 == ~mode2~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {48959#true} assume ~id3~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {48959#true} assume 0 == ~st3~0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {48959#true} assume ~send3~0 == ~id3~0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {48959#true} assume 0 == ~mode3~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {48959#true} assume ~id4~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {48959#true} assume 0 == ~st4~0; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {48959#true} assume ~send4~0 == ~id4~0; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {48959#true} assume 0 == ~mode4~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {48959#true} assume ~id5~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {48959#true} assume 0 == ~st5~0; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {48959#true} assume ~send5~0 == ~id5~0; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {48959#true} assume 0 == ~mode5~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {48959#true} assume ~id6~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {48959#true} assume 0 == ~st6~0; {48959#true} is VALID [2022-02-20 19:51:34,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {48959#true} assume ~send6~0 == ~id6~0; {48959#true} is VALID [2022-02-20 19:51:34,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {48959#true} assume 0 == ~mode6~0 % 256; {48959#true} is VALID [2022-02-20 19:51:34,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {48959#true} assume ~id7~0 >= 0; {48959#true} is VALID [2022-02-20 19:51:34,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {48959#true} assume 0 == ~st7~0; {48959#true} is VALID [2022-02-20 19:51:34,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {48959#true} assume ~send7~0 == ~id7~0; {48959#true} is VALID [2022-02-20 19:51:34,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {48959#true} assume 0 == ~mode7~0 % 256; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,964 INFO L290 TraceCheckUtils]: 68: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,965 INFO L290 TraceCheckUtils]: 71: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,967 INFO L290 TraceCheckUtils]: 75: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,967 INFO L290 TraceCheckUtils]: 76: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,968 INFO L290 TraceCheckUtils]: 79: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,968 INFO L290 TraceCheckUtils]: 80: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,969 INFO L290 TraceCheckUtils]: 81: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:34,969 INFO L290 TraceCheckUtils]: 82: Hoare triple {48961#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {48960#false} is VALID [2022-02-20 19:51:34,969 INFO L290 TraceCheckUtils]: 83: Hoare triple {48960#false} assume !(node7_~m7~0#1 != ~nomsg~0); {48960#false} is VALID [2022-02-20 19:51:34,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {48960#false} ~mode7~0 := 0; {48960#false} is VALID [2022-02-20 19:51:34,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {48960#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; {48960#false} is VALID [2022-02-20 19:51:34,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {48960#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {48960#false} is VALID [2022-02-20 19:51:34,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {48960#false} check_#res#1 := check_~tmp~1#1; {48960#false} is VALID [2022-02-20 19:51:34,970 INFO L290 TraceCheckUtils]: 88: Hoare triple {48960#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; {48960#false} is VALID [2022-02-20 19:51:34,970 INFO L290 TraceCheckUtils]: 89: Hoare triple {48960#false} assume 0 == assert_~arg#1 % 256; {48960#false} is VALID [2022-02-20 19:51:34,970 INFO L290 TraceCheckUtils]: 90: Hoare triple {48960#false} assume !false; {48960#false} is VALID [2022-02-20 19:51:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:34,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:34,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761824005] [2022-02-20 19:51:34,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761824005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:34,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:34,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:34,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664319681] [2022-02-20 19:51:34,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:34,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:51:34,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:34,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:35,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:35,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:35,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:35,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:35,025 INFO L87 Difference]: Start difference. First operand 2459 states and 4273 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:37,238 INFO L93 Difference]: Finished difference Result 4159 states and 6931 transitions. [2022-02-20 19:51:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:37,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:37,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:38,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:38,945 INFO L225 Difference]: With dead ends: 4159 [2022-02-20 19:51:38,946 INFO L226 Difference]: Without dead ends: 3261 [2022-02-20 19:51:38,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:38,948 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:38,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1516 Valid, 1787 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-02-20 19:51:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3259. [2022-02-20 19:51:39,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:39,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.6902057107767885) internal successors, (5505), 3258 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:39,134 INFO L74 IsIncluded]: Start isIncluded. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.6902057107767885) internal successors, (5505), 3258 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:39,136 INFO L87 Difference]: Start difference. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.6902057107767885) internal successors, (5505), 3258 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:39,444 INFO L93 Difference]: Finished difference Result 3261 states and 5506 transitions. [2022-02-20 19:51:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 5506 transitions. [2022-02-20 19:51:39,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:39,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:39,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 3259 states, 3257 states have (on average 1.6902057107767885) internal successors, (5505), 3258 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3261 states. [2022-02-20 19:51:39,453 INFO L87 Difference]: Start difference. First operand has 3259 states, 3257 states have (on average 1.6902057107767885) internal successors, (5505), 3258 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3261 states. [2022-02-20 19:51:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:39,746 INFO L93 Difference]: Finished difference Result 3261 states and 5506 transitions. [2022-02-20 19:51:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 5506 transitions. [2022-02-20 19:51:39,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:39,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:39,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:39,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 3257 states have (on average 1.6902057107767885) internal successors, (5505), 3258 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5505 transitions. [2022-02-20 19:51:40,116 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5505 transitions. Word has length 91 [2022-02-20 19:51:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:40,117 INFO L470 AbstractCegarLoop]: Abstraction has 3259 states and 5505 transitions. [2022-02-20 19:51:40,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5505 transitions. [2022-02-20 19:51:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:40,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:40,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:40,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:51:40,118 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1109178805, now seen corresponding path program 1 times [2022-02-20 19:51:40,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:40,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566747663] [2022-02-20 19:51:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:40,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {63726#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {63726#true} is VALID [2022-02-20 19:51:40,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {63726#true} is VALID [2022-02-20 19:51:40,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {63726#true} is VALID [2022-02-20 19:51:40,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {63726#true} assume 0 == ~r1~0 % 256; {63726#true} is VALID [2022-02-20 19:51:40,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {63726#true} assume ~id1~0 >= 0; {63726#true} is VALID [2022-02-20 19:51:40,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} assume 0 == ~st1~0; {63728#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:40,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {63728#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {63728#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:40,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {63728#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {63728#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:40,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {63728#(<= ~st1~0 0)} assume ~id2~0 >= 0; {63728#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:40,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {63728#(<= ~st1~0 0)} assume 0 == ~st2~0; {63729#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {63729#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {63729#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {63729#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {63729#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {63729#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {63729#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {63729#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {63730#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {63731#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:40,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {63732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {63733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,229 INFO L290 TraceCheckUtils]: 81: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,231 INFO L290 TraceCheckUtils]: 85: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:40,231 INFO L290 TraceCheckUtils]: 86: Hoare triple {63734#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {63727#false} is VALID [2022-02-20 19:51:40,231 INFO L290 TraceCheckUtils]: 87: Hoare triple {63727#false} check_#res#1 := check_~tmp~1#1; {63727#false} is VALID [2022-02-20 19:51:40,231 INFO L290 TraceCheckUtils]: 88: Hoare triple {63727#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; {63727#false} is VALID [2022-02-20 19:51:40,232 INFO L290 TraceCheckUtils]: 89: Hoare triple {63727#false} assume 0 == assert_~arg#1 % 256; {63727#false} is VALID [2022-02-20 19:51:40,232 INFO L290 TraceCheckUtils]: 90: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-02-20 19:51:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:51:40,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:40,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566747663] [2022-02-20 19:51:40,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566747663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:40,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:40,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:51:40,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616773582] [2022-02-20 19:51:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:40,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:40,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:40,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:40,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:40,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:51:40,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:40,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:51:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:51:40,289 INFO L87 Difference]: Start difference. First operand 3259 states and 5505 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)