./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.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 d52f31574095462f7bebf0d97516364dd650b64428a7b12e3aa21d1b47f96325 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:30:22,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:30:22,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:30:22,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:30:22,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:30:22,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:30:22,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:30:22,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:30:22,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:30:22,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:30:22,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:30:22,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:30:22,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:30:22,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:30:22,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:30:22,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:30:22,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:30:22,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:30:22,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:30:22,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:30:22,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:30:22,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:30:22,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:30:22,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:30:22,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:30:22,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:30:22,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:30:22,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:30:22,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:30:22,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:30:22,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:30:22,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:30:22,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:30:22,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:30:22,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:30:22,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:30:22,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:30:22,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:30:22,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:30:22,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:30:22,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:30:22,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:30:22,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:30:22,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:30:22,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:30:22,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:30:22,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:30:22,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:30:22,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:30:22,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:30:22,354 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:30:22,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:30:22,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:30:22,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:30:22,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:30:22,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:30:22,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:30:22,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:30:22,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:30:22,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:30:22,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:30:22,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:30:22,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:30:22,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:30:22,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:30:22,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:30:22,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:22,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:30:22,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:30:22,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:30:22,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:30:22,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:30:22,358 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:30:22,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:30:22,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:30:22,358 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 -> d52f31574095462f7bebf0d97516364dd650b64428a7b12e3aa21d1b47f96325 [2022-02-20 18:30:22,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:30:22,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:30:22,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:30:22,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:30:22,571 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:30:22,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:22,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbc47316/f64cbea9b2d84b8ea1369ff8879b5084/FLAGd22a6f435 [2022-02-20 18:30:22,965 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:30:22,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:22,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbc47316/f64cbea9b2d84b8ea1369ff8879b5084/FLAGd22a6f435 [2022-02-20 18:30:23,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbc47316/f64cbea9b2d84b8ea1369ff8879b5084 [2022-02-20 18:30:23,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:30:23,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:30:23,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:23,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:30:23,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:30:23,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43711d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23, skipping insertion in model container [2022-02-20 18:30:23,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:30:23,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:30:23,620 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/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2022-02-20 18:30:23,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:23,628 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:30:23,668 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/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2022-02-20 18:30:23,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:23,679 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:30:23,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23 WrapperNode [2022-02-20 18:30:23,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:23,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:23,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:30:23,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:30:23,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,725 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 452 [2022-02-20 18:30:23,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:23,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:30:23,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:30:23,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:30:23,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:30:23,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:30:23,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:30:23,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:30:23,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (1/1) ... [2022-02-20 18:30:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:30:23,796 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 18:30:23,798 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 18:30:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:30:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:30:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:30:23,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:30:23,965 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:30:23,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:30:24,390 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:30:24,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:30:24,396 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:30:24,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:24 BoogieIcfgContainer [2022-02-20 18:30:24,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:30:24,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:30:24,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:30:24,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:30:24,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:30:23" (1/3) ... [2022-02-20 18:30:24,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614dbd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:24, skipping insertion in model container [2022-02-20 18:30:24,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:23" (2/3) ... [2022-02-20 18:30:24,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614dbd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:24, skipping insertion in model container [2022-02-20 18:30:24,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:24" (3/3) ... [2022-02-20 18:30:24,403 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:24,406 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:30:24,406 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:30:24,437 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:30:24,441 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 18:30:24,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:30:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.75) internal successors, (224), 129 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:30:24,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:24,461 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] [2022-02-20 18:30:24,461 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1880075128, now seen corresponding path program 1 times [2022-02-20 18:30:24,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:24,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165150314] [2022-02-20 18:30:24,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:24,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:24,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#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(34, 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; {133#true} is VALID [2022-02-20 18:30:24,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {133#true} is VALID [2022-02-20 18:30:24,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {133#true} is VALID [2022-02-20 18:30:24,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#true} init_#res#1 := init_~tmp~0#1; {133#true} is VALID [2022-02-20 18:30:24,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {133#true} is VALID [2022-02-20 18:30:24,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {134#false} is VALID [2022-02-20 18:30:24,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#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;main_~i2~0#1 := 0; {134#false} is VALID [2022-02-20 18:30:24,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#false} assume !(0 != ~mode1~0 % 256); {134#false} is VALID [2022-02-20 18:30:24,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {134#false} is VALID [2022-02-20 18:30:24,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {134#false} is VALID [2022-02-20 18:30:24,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#false} assume !(0 != ~mode2~0 % 256); {134#false} is VALID [2022-02-20 18:30:24,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {134#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {134#false} is VALID [2022-02-20 18:30:24,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {134#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {134#false} is VALID [2022-02-20 18:30:24,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {134#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {134#false} assume !(0 != ~mode3~0 % 256); {134#false} is VALID [2022-02-20 18:30:24,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {134#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {134#false} is VALID [2022-02-20 18:30:24,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {134#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {134#false} is VALID [2022-02-20 18:30:24,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {134#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {134#false} assume !(0 != ~mode4~0 % 256); {134#false} is VALID [2022-02-20 18:30:24,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {134#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {134#false} is VALID [2022-02-20 18:30:24,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {134#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {134#false} is VALID [2022-02-20 18:30:24,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {134#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {134#false} assume !(0 != ~mode5~0 % 256); {134#false} is VALID [2022-02-20 18:30:24,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {134#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {134#false} is VALID [2022-02-20 18:30:24,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {134#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {134#false} is VALID [2022-02-20 18:30:24,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {134#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {134#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {134#false} assume !(node6_~m6~0#1 != ~nomsg~0); {134#false} is VALID [2022-02-20 18:30:24,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {134#false} ~mode6~0 := 0; {134#false} is VALID [2022-02-20 18:30:24,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {134#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {134#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {134#false} is VALID [2022-02-20 18:30:24,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {134#false} assume !(node7_~m7~0#1 != ~nomsg~0); {134#false} is VALID [2022-02-20 18:30:24,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {134#false} ~mode7~0 := 0; {134#false} is VALID [2022-02-20 18:30:24,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {134#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; {134#false} is VALID [2022-02-20 18:30:24,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {134#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {134#false} is VALID [2022-02-20 18:30:24,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {134#false} check_#res#1 := check_~tmp~1#1; {134#false} is VALID [2022-02-20 18:30:24,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {134#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {134#false} is VALID [2022-02-20 18:30:24,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {134#false} assume 0 == assert_~arg#1 % 256; {134#false} is VALID [2022-02-20 18:30:24,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {134#false} assume !false; {134#false} is VALID [2022-02-20 18:30:24,697 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 18:30:24,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:24,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165150314] [2022-02-20 18:30:24,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165150314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:24,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:24,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:30:24,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555295285] [2022-02-20 18:30:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:30:24,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:24,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:24,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:24,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:30:24,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:30:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:24,779 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.75) internal successors, (224), 129 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:24,903 INFO L93 Difference]: Finished difference Result 201 states and 339 transitions. [2022-02-20 18:30:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:30:24,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:30:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2022-02-20 18:30:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2022-02-20 18:30:24,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 339 transitions. [2022-02-20 18:30:25,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 339 edges. 339 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:25,234 INFO L225 Difference]: With dead ends: 201 [2022-02-20 18:30:25,234 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 18:30:25,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:25,238 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:25,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 18:30:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-02-20 18:30:25,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:25,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 125 states have (on average 1.736) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,261 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 125 states have (on average 1.736) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,261 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 125 states have (on average 1.736) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:25,266 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2022-02-20 18:30:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 217 transitions. [2022-02-20 18:30:25,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:25,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:25,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 125 states have (on average 1.736) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 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 126 states. [2022-02-20 18:30:25,267 INFO L87 Difference]: Start difference. First operand has 126 states, 125 states have (on average 1.736) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 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 126 states. [2022-02-20 18:30:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:25,271 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2022-02-20 18:30:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 217 transitions. [2022-02-20 18:30:25,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:25,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:25,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:25,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.736) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2022-02-20 18:30:25,277 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 217 transitions. Word has length 41 [2022-02-20 18:30:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:25,277 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-02-20 18:30:25,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 217 transitions. [2022-02-20 18:30:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:30:25,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:25,279 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] [2022-02-20 18:30:25,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:30:25,279 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2020525382, now seen corresponding path program 1 times [2022-02-20 18:30:25,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:25,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692493792] [2022-02-20 18:30:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:25,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {749#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(34, 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; {749#true} is VALID [2022-02-20 18:30:25,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {749#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {749#true} is VALID [2022-02-20 18:30:25,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {749#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {751#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:30:25,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {751#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {752#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:30:25,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {752#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {753#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:30:25,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {750#false} is VALID [2022-02-20 18:30:25,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {750#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;main_~i2~0#1 := 0; {750#false} is VALID [2022-02-20 18:30:25,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {750#false} assume !(0 != ~mode1~0 % 256); {750#false} is VALID [2022-02-20 18:30:25,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {750#false} is VALID [2022-02-20 18:30:25,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {750#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {750#false} is VALID [2022-02-20 18:30:25,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {750#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#false} assume !(0 != ~mode2~0 % 256); {750#false} is VALID [2022-02-20 18:30:25,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {750#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {750#false} is VALID [2022-02-20 18:30:25,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {750#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {750#false} is VALID [2022-02-20 18:30:25,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {750#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {750#false} assume !(0 != ~mode3~0 % 256); {750#false} is VALID [2022-02-20 18:30:25,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {750#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {750#false} is VALID [2022-02-20 18:30:25,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {750#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {750#false} is VALID [2022-02-20 18:30:25,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {750#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {750#false} assume !(0 != ~mode4~0 % 256); {750#false} is VALID [2022-02-20 18:30:25,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {750#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {750#false} is VALID [2022-02-20 18:30:25,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {750#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {750#false} is VALID [2022-02-20 18:30:25,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {750#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {750#false} assume !(0 != ~mode5~0 % 256); {750#false} is VALID [2022-02-20 18:30:25,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {750#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {750#false} is VALID [2022-02-20 18:30:25,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {750#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {750#false} is VALID [2022-02-20 18:30:25,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {750#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {750#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {750#false} assume !(node6_~m6~0#1 != ~nomsg~0); {750#false} is VALID [2022-02-20 18:30:25,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {750#false} ~mode6~0 := 0; {750#false} is VALID [2022-02-20 18:30:25,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {750#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {750#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {750#false} is VALID [2022-02-20 18:30:25,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {750#false} assume !(node7_~m7~0#1 != ~nomsg~0); {750#false} is VALID [2022-02-20 18:30:25,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {750#false} ~mode7~0 := 0; {750#false} is VALID [2022-02-20 18:30:25,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {750#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; {750#false} is VALID [2022-02-20 18:30:25,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {750#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {750#false} is VALID [2022-02-20 18:30:25,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {750#false} check_#res#1 := check_~tmp~1#1; {750#false} is VALID [2022-02-20 18:30:25,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {750#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {750#false} is VALID [2022-02-20 18:30:25,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {750#false} assume 0 == assert_~arg#1 % 256; {750#false} is VALID [2022-02-20 18:30:25,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {750#false} assume !false; {750#false} is VALID [2022-02-20 18:30:25,361 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 18:30:25,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:25,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692493792] [2022-02-20 18:30:25,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692493792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:25,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:25,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:30:25,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981564338] [2022-02-20 18:30:25,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:25,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:30:25,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:25,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:25,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:30:25,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:25,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:30:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:30:25,391 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:25,767 INFO L93 Difference]: Finished difference Result 200 states and 332 transitions. [2022-02-20 18:30:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:30:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:30:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 332 transitions. [2022-02-20 18:30:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 332 transitions. [2022-02-20 18:30:25,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 332 transitions. [2022-02-20 18:30:25,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:25,958 INFO L225 Difference]: With dead ends: 200 [2022-02-20 18:30:25,958 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 18:30:25,961 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 18:30:25,963 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 807 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 18:30:25,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 807 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 18:30:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-02-20 18:30:25,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:25,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,975 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,976 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:25,979 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2022-02-20 18:30:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-02-20 18:30:25,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:25,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:25,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 0 states have call successors, (0), 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 126 states. [2022-02-20 18:30:25,984 INFO L87 Difference]: Start difference. First operand has 126 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 0 states have call successors, (0), 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 126 states. [2022-02-20 18:30:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:25,988 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2022-02-20 18:30:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-02-20 18:30:25,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:25,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:25,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:25,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2022-02-20 18:30:26,006 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 41 [2022-02-20 18:30:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:26,006 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2022-02-20 18:30:26,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-02-20 18:30:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 18:30:26,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:26,011 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] [2022-02-20 18:30:26,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:30:26,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1655570070, now seen corresponding path program 1 times [2022-02-20 18:30:26,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:26,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812846641] [2022-02-20 18:30:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:26,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {1371#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(34, 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; {1371#true} is VALID [2022-02-20 18:30:26,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {1371#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1371#true} is VALID [2022-02-20 18:30:26,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1371#true} assume 0 == ~r1~0 % 256; {1371#true} is VALID [2022-02-20 18:30:26,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {1371#true} assume ~id1~0 >= 0; {1371#true} is VALID [2022-02-20 18:30:26,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {1371#true} assume 0 == ~st1~0; {1371#true} is VALID [2022-02-20 18:30:26,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1371#true} assume ~send1~0 == ~id1~0; {1371#true} is VALID [2022-02-20 18:30:26,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {1371#true} assume 0 == ~mode1~0 % 256; {1371#true} is VALID [2022-02-20 18:30:26,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {1371#true} assume ~id2~0 >= 0; {1371#true} is VALID [2022-02-20 18:30:26,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {1371#true} assume 0 == ~st2~0; {1371#true} is VALID [2022-02-20 18:30:26,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1371#true} assume ~send2~0 == ~id2~0; {1371#true} is VALID [2022-02-20 18:30:26,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#true} assume 0 == ~mode2~0 % 256; {1371#true} is VALID [2022-02-20 18:30:26,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#true} assume ~id3~0 >= 0; {1371#true} is VALID [2022-02-20 18:30:26,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#true} assume 0 == ~st3~0; {1371#true} is VALID [2022-02-20 18:30:26,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {1371#true} assume ~send3~0 == ~id3~0; {1371#true} is VALID [2022-02-20 18:30:26,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {1371#true} assume 0 == ~mode3~0 % 256; {1371#true} is VALID [2022-02-20 18:30:26,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#true} assume ~id4~0 >= 0; {1371#true} is VALID [2022-02-20 18:30:26,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#true} assume 0 == ~st4~0; {1371#true} is VALID [2022-02-20 18:30:26,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {1371#true} assume ~send4~0 == ~id4~0; {1371#true} is VALID [2022-02-20 18:30:26,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {1371#true} assume 0 == ~mode4~0 % 256; {1371#true} is VALID [2022-02-20 18:30:26,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {1371#true} assume ~id5~0 >= 0; {1371#true} is VALID [2022-02-20 18:30:26,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {1371#true} assume 0 == ~st5~0; {1371#true} is VALID [2022-02-20 18:30:26,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {1371#true} assume ~send5~0 == ~id5~0; {1371#true} is VALID [2022-02-20 18:30:26,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {1371#true} assume 0 == ~mode5~0 % 256; {1371#true} is VALID [2022-02-20 18:30:26,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {1371#true} assume ~id6~0 >= 0; {1371#true} is VALID [2022-02-20 18:30:26,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {1371#true} assume 0 == ~st6~0; {1371#true} is VALID [2022-02-20 18:30:26,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {1371#true} assume ~send6~0 == ~id6~0; {1371#true} is VALID [2022-02-20 18:30:26,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {1371#true} assume 0 == ~mode6~0 % 256; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,157 INFO L290 TraceCheckUtils]: 50: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {1373#(= (+ (* (- 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;main_~i2~0#1 := 0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,162 INFO L290 TraceCheckUtils]: 63: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,167 INFO L290 TraceCheckUtils]: 74: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,167 INFO L290 TraceCheckUtils]: 75: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1373#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:26,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {1373#(= (+ (* (- 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; {1372#false} is VALID [2022-02-20 18:30:26,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {1372#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1372#false} is VALID [2022-02-20 18:30:26,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {1372#false} ~mode6~0 := 0; {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 80: Hoare triple {1372#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 81: Hoare triple {1372#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {1372#false} assume !(node7_~m7~0#1 != ~nomsg~0); {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {1372#false} ~mode7~0 := 0; {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {1372#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; {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {1372#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {1372#false} is VALID [2022-02-20 18:30:26,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {1372#false} check_#res#1 := check_~tmp~1#1; {1372#false} is VALID [2022-02-20 18:30:26,170 INFO L290 TraceCheckUtils]: 87: Hoare triple {1372#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1372#false} is VALID [2022-02-20 18:30:26,170 INFO L290 TraceCheckUtils]: 88: Hoare triple {1372#false} assume 0 == assert_~arg#1 % 256; {1372#false} is VALID [2022-02-20 18:30:26,170 INFO L290 TraceCheckUtils]: 89: Hoare triple {1372#false} assume !false; {1372#false} is VALID [2022-02-20 18:30:26,171 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 18:30:26,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:26,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812846641] [2022-02-20 18:30:26,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812846641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:26,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:26,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:26,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695635690] [2022-02-20 18:30:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:26,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:30:26,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:26,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:26,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:26,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:26,234 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:26,401 INFO L93 Difference]: Finished difference Result 260 states and 379 transitions. [2022-02-20 18:30:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:30:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:26,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 379 transitions. [2022-02-20 18:30:26,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:26,643 INFO L225 Difference]: With dead ends: 260 [2022-02-20 18:30:26,644 INFO L226 Difference]: Without dead ends: 190 [2022-02-20 18:30:26,645 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 18:30:26,650 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 81 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 325 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 18:30:26,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 325 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-02-20 18:30:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2022-02-20 18:30:26,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:26,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 187 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,656 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 187 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,657 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 188 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 187 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:26,660 INFO L93 Difference]: Finished difference Result 190 states and 267 transitions. [2022-02-20 18:30:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 267 transitions. [2022-02-20 18:30:26,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:26,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:26,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 187 states have internal predecessors, (266), 0 states have call successors, (0), 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 190 states. [2022-02-20 18:30:26,661 INFO L87 Difference]: Start difference. First operand has 188 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 187 states have internal predecessors, (266), 0 states have call successors, (0), 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 190 states. [2022-02-20 18:30:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:26,677 INFO L93 Difference]: Finished difference Result 190 states and 267 transitions. [2022-02-20 18:30:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 267 transitions. [2022-02-20 18:30:26,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:26,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:26,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:26,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 187 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2022-02-20 18:30:26,682 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 90 [2022-02-20 18:30:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:26,682 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2022-02-20 18:30:26,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2022-02-20 18:30:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 18:30:26,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:26,683 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] [2022-02-20 18:30:26,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:30:26,683 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1317776928, now seen corresponding path program 1 times [2022-02-20 18:30:26,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:26,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844095722] [2022-02-20 18:30:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:26,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:26,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {2256#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(34, 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; {2256#true} is VALID [2022-02-20 18:30:26,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2256#true} is VALID [2022-02-20 18:30:26,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume 0 == ~r1~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {2256#true} assume ~id1~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {2256#true} assume 0 == ~st1~0; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} assume ~send1~0 == ~id1~0; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2256#true} assume 0 == ~mode1~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {2256#true} assume ~id2~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {2256#true} assume 0 == ~st2~0; {2256#true} is VALID [2022-02-20 18:30:26,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {2256#true} assume ~send2~0 == ~id2~0; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {2256#true} assume 0 == ~mode2~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {2256#true} assume ~id3~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {2256#true} assume 0 == ~st3~0; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {2256#true} assume ~send3~0 == ~id3~0; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#true} assume 0 == ~mode3~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {2256#true} assume ~id4~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {2256#true} assume 0 == ~st4~0; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {2256#true} assume ~send4~0 == ~id4~0; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {2256#true} assume 0 == ~mode4~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {2256#true} assume ~id5~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {2256#true} assume 0 == ~st5~0; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {2256#true} assume ~send5~0 == ~id5~0; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {2256#true} assume 0 == ~mode5~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {2256#true} assume ~id6~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {2256#true} assume 0 == ~st6~0; {2256#true} is VALID [2022-02-20 18:30:26,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {2256#true} assume ~send6~0 == ~id6~0; {2256#true} is VALID [2022-02-20 18:30:26,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#true} assume 0 == ~mode6~0 % 256; {2256#true} is VALID [2022-02-20 18:30:26,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#true} assume ~id7~0 >= 0; {2256#true} is VALID [2022-02-20 18:30:26,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {2256#true} assume 0 == ~st7~0; {2256#true} is VALID [2022-02-20 18:30:26,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {2256#true} assume ~send7~0 == ~id7~0; {2256#true} is VALID [2022-02-20 18:30:26,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#true} assume 0 == ~mode7~0 % 256; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {2258#(= (+ ~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;main_~i2~0#1 := 0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,797 INFO L290 TraceCheckUtils]: 79: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,797 INFO L290 TraceCheckUtils]: 80: Hoare triple {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {2258#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:30:26,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {2258#(= (+ ~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; {2257#false} is VALID [2022-02-20 18:30:26,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {2257#false} assume !(node7_~m7~0#1 != ~nomsg~0); {2257#false} is VALID [2022-02-20 18:30:26,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {2257#false} ~mode7~0 := 0; {2257#false} is VALID [2022-02-20 18:30:26,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {2257#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; {2257#false} is VALID [2022-02-20 18:30:26,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {2257#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {2257#false} is VALID [2022-02-20 18:30:26,798 INFO L290 TraceCheckUtils]: 86: Hoare triple {2257#false} check_#res#1 := check_~tmp~1#1; {2257#false} is VALID [2022-02-20 18:30:26,799 INFO L290 TraceCheckUtils]: 87: Hoare triple {2257#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2257#false} is VALID [2022-02-20 18:30:26,799 INFO L290 TraceCheckUtils]: 88: Hoare triple {2257#false} assume 0 == assert_~arg#1 % 256; {2257#false} is VALID [2022-02-20 18:30:26,799 INFO L290 TraceCheckUtils]: 89: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-02-20 18:30:26,799 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 18:30:26,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:26,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844095722] [2022-02-20 18:30:26,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844095722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:26,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:26,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:26,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105196761] [2022-02-20 18:30:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:30:26,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:26,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:26,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:26,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:26,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:26,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:26,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:26,854 INFO L87 Difference]: Start difference. First operand 188 states and 266 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:27,043 INFO L93 Difference]: Finished difference Result 440 states and 666 transitions. [2022-02-20 18:30:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:30:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:27,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 379 transitions. [2022-02-20 18:30:27,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:27,322 INFO L225 Difference]: With dead ends: 440 [2022-02-20 18:30:27,322 INFO L226 Difference]: Without dead ends: 308 [2022-02-20 18:30:27,323 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 18:30:27,324 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 77 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 324 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 18:30:27,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 324 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-02-20 18:30:27,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2022-02-20 18:30:27,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:27,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand has 306 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 305 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,334 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand has 306 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 305 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,334 INFO L87 Difference]: Start difference. First operand 308 states. Second operand has 306 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 305 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:27,360 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2022-02-20 18:30:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 454 transitions. [2022-02-20 18:30:27,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:27,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:27,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 305 states have internal predecessors, (453), 0 states have call successors, (0), 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 308 states. [2022-02-20 18:30:27,361 INFO L87 Difference]: Start difference. First operand has 306 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 305 states have internal predecessors, (453), 0 states have call successors, (0), 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 308 states. [2022-02-20 18:30:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:27,370 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2022-02-20 18:30:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 454 transitions. [2022-02-20 18:30:27,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:27,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:27,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:27,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 305 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 453 transitions. [2022-02-20 18:30:27,379 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 453 transitions. Word has length 90 [2022-02-20 18:30:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:27,379 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 453 transitions. [2022-02-20 18:30:27,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 453 transitions. [2022-02-20 18:30:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 18:30:27,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:27,380 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] [2022-02-20 18:30:27,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:30:27,380 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -99791530, now seen corresponding path program 1 times [2022-02-20 18:30:27,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:27,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522131096] [2022-02-20 18:30:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:27,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {3725#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(34, 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; {3725#true} is VALID [2022-02-20 18:30:27,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {3725#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3725#true} is VALID [2022-02-20 18:30:27,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {3725#true} assume 0 == ~r1~0 % 256; {3725#true} is VALID [2022-02-20 18:30:27,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {3725#true} assume ~id1~0 >= 0; {3725#true} is VALID [2022-02-20 18:30:27,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {3725#true} assume 0 == ~st1~0; {3727#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:27,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {3727#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3727#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:27,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {3727#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3727#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:27,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {3727#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3727#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:27,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {3727#(<= ~st1~0 0)} assume 0 == ~st2~0; {3728#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {3728#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3728#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {3728#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3728#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {3728#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3728#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {3728#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {3729#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {3730#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:27,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {3731#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {3732#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {3733#(<= (+ ~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; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,539 INFO L290 TraceCheckUtils]: 55: Hoare triple {3733#(<= (+ ~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;main_~i2~0#1 := 0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,539 INFO L290 TraceCheckUtils]: 56: Hoare triple {3733#(<= (+ ~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~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {3733#(<= (+ ~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~ite4#1 := ~send1~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {3733#(<= (+ ~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~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {3733#(<= (+ ~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~ite5#1 := ~send2~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {3733#(<= (+ ~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~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,543 INFO L290 TraceCheckUtils]: 66: Hoare triple {3733#(<= (+ ~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~ite6#1 := ~send3~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,544 INFO L290 TraceCheckUtils]: 68: Hoare triple {3733#(<= (+ ~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~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,544 INFO L290 TraceCheckUtils]: 69: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {3733#(<= (+ ~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~ite7#1 := ~send4~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,545 INFO L290 TraceCheckUtils]: 71: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,545 INFO L290 TraceCheckUtils]: 72: Hoare triple {3733#(<= (+ ~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~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,546 INFO L290 TraceCheckUtils]: 74: Hoare triple {3733#(<= (+ ~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~ite8#1 := ~send5~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,548 INFO L290 TraceCheckUtils]: 76: Hoare triple {3733#(<= (+ ~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~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,550 INFO L290 TraceCheckUtils]: 77: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,550 INFO L290 TraceCheckUtils]: 78: Hoare triple {3733#(<= (+ ~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~ite9#1 := ~send6~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,550 INFO L290 TraceCheckUtils]: 79: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,551 INFO L290 TraceCheckUtils]: 80: Hoare triple {3733#(<= (+ ~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~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,551 INFO L290 TraceCheckUtils]: 82: Hoare triple {3733#(<= (+ ~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~ite10#1 := ~send7~0; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,552 INFO L290 TraceCheckUtils]: 83: Hoare triple {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,555 INFO L290 TraceCheckUtils]: 84: Hoare triple {3733#(<= (+ ~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; {3733#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:27,555 INFO L290 TraceCheckUtils]: 85: Hoare triple {3733#(<= (+ ~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; {3726#false} is VALID [2022-02-20 18:30:27,555 INFO L290 TraceCheckUtils]: 86: Hoare triple {3726#false} check_#res#1 := check_~tmp~1#1; {3726#false} is VALID [2022-02-20 18:30:27,555 INFO L290 TraceCheckUtils]: 87: Hoare triple {3726#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3726#false} is VALID [2022-02-20 18:30:27,555 INFO L290 TraceCheckUtils]: 88: Hoare triple {3726#false} assume 0 == assert_~arg#1 % 256; {3726#false} is VALID [2022-02-20 18:30:27,556 INFO L290 TraceCheckUtils]: 89: Hoare triple {3726#false} assume !false; {3726#false} is VALID [2022-02-20 18:30:27,556 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 18:30:27,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:27,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522131096] [2022-02-20 18:30:27,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522131096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:27,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:27,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:30:27,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382187770] [2022-02-20 18:30:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:27,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:30:27,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:27,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:27,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:30:27,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:30:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:30:27,613 INFO L87 Difference]: Start difference. First operand 306 states and 453 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:31,221 INFO L93 Difference]: Finished difference Result 3806 states and 6011 transitions. [2022-02-20 18:30:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:30:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:30:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1721 transitions. [2022-02-20 18:30:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1721 transitions. [2022-02-20 18:30:31,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 1721 transitions. [2022-02-20 18:30:32,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:32,617 INFO L225 Difference]: With dead ends: 3806 [2022-02-20 18:30:32,617 INFO L226 Difference]: Without dead ends: 3556 [2022-02-20 18:30:32,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:30:32,619 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 2558 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2558 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:32,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2558 Valid, 2078 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2022-02-20 18:30:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 554. [2022-02-20 18:30:32,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:32,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3556 states. Second operand has 554 states, 553 states have (on average 1.5207956600361663) internal successors, (841), 553 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:32,842 INFO L74 IsIncluded]: Start isIncluded. First operand 3556 states. Second operand has 554 states, 553 states have (on average 1.5207956600361663) internal successors, (841), 553 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:32,842 INFO L87 Difference]: Start difference. First operand 3556 states. Second operand has 554 states, 553 states have (on average 1.5207956600361663) internal successors, (841), 553 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,268 INFO L93 Difference]: Finished difference Result 3556 states and 5558 transitions. [2022-02-20 18:30:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 5558 transitions. [2022-02-20 18:30:33,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:33,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:33,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 554 states, 553 states have (on average 1.5207956600361663) internal successors, (841), 553 states have internal predecessors, (841), 0 states have call successors, (0), 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 3556 states. [2022-02-20 18:30:33,275 INFO L87 Difference]: Start difference. First operand has 554 states, 553 states have (on average 1.5207956600361663) internal successors, (841), 553 states have internal predecessors, (841), 0 states have call successors, (0), 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 3556 states. [2022-02-20 18:30:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,743 INFO L93 Difference]: Finished difference Result 3556 states and 5558 transitions. [2022-02-20 18:30:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 5558 transitions. [2022-02-20 18:30:33,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:33,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:33,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:33,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.5207956600361663) internal successors, (841), 553 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 841 transitions. [2022-02-20 18:30:33,778 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 841 transitions. Word has length 90 [2022-02-20 18:30:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:33,778 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 841 transitions. [2022-02-20 18:30:33,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 841 transitions. [2022-02-20 18:30:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:30:33,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:33,779 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, 1] [2022-02-20 18:30:33,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:30:33,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1468897702, now seen corresponding path program 1 times [2022-02-20 18:30:33,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:33,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489462693] [2022-02-20 18:30:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:33,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {15913#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(34, 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; {15913#true} is VALID [2022-02-20 18:30:33,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {15913#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15913#true} is VALID [2022-02-20 18:30:33,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {15913#true} assume 0 == ~r1~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id6~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 == ~id6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode6~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id7~0 >= 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send7~0 == ~id7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode7~0 % 256; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 != ~id6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 != ~id7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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;main_~i2~0#1 := 0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,930 INFO L290 TraceCheckUtils]: 59: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,930 INFO L290 TraceCheckUtils]: 60: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,930 INFO L290 TraceCheckUtils]: 61: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,931 INFO L290 TraceCheckUtils]: 63: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,931 INFO L290 TraceCheckUtils]: 64: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,931 INFO L290 TraceCheckUtils]: 65: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,932 INFO L290 TraceCheckUtils]: 67: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,932 INFO L290 TraceCheckUtils]: 68: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,934 INFO L290 TraceCheckUtils]: 74: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode6~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,936 INFO L290 TraceCheckUtils]: 78: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,936 INFO L290 TraceCheckUtils]: 79: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode7~0 % 256); {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,937 INFO L290 TraceCheckUtils]: 82: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,939 INFO L290 TraceCheckUtils]: 84: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,939 INFO L290 TraceCheckUtils]: 85: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:33,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {15915#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 7; {15914#false} is VALID [2022-02-20 18:30:33,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {15914#false} assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; {15914#false} is VALID [2022-02-20 18:30:33,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {15914#false} check_#res#1 := check_~tmp~1#1; {15914#false} is VALID [2022-02-20 18:30:33,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {15914#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15914#false} is VALID [2022-02-20 18:30:33,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {15914#false} assume 0 == assert_~arg#1 % 256; {15914#false} is VALID [2022-02-20 18:30:33,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {15914#false} assume !false; {15914#false} is VALID [2022-02-20 18:30:33,942 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 18:30:33,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:33,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489462693] [2022-02-20 18:30:33,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489462693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:33,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:33,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:33,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750242537] [2022-02-20 18:30:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:33,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:33,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:33,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:34,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:34,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:34,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:34,046 INFO L87 Difference]: Start difference. First operand 554 states and 841 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:34,817 INFO L93 Difference]: Finished difference Result 1506 states and 2335 transitions. [2022-02-20 18:30:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-02-20 18:30:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-02-20 18:30:34,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 380 transitions. [2022-02-20 18:30:35,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:35,092 INFO L225 Difference]: With dead ends: 1506 [2022-02-20 18:30:35,093 INFO L226 Difference]: Without dead ends: 1008 [2022-02-20 18:30:35,099 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 18:30:35,100 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 68 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:35,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-02-20 18:30:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 998. [2022-02-20 18:30:35,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:35,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1008 states. Second operand has 998 states, 997 states have (on average 1.5255767301905716) internal successors, (1521), 997 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,558 INFO L74 IsIncluded]: Start isIncluded. First operand 1008 states. Second operand has 998 states, 997 states have (on average 1.5255767301905716) internal successors, (1521), 997 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,559 INFO L87 Difference]: Start difference. First operand 1008 states. Second operand has 998 states, 997 states have (on average 1.5255767301905716) internal successors, (1521), 997 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:35,589 INFO L93 Difference]: Finished difference Result 1008 states and 1530 transitions. [2022-02-20 18:30:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1530 transitions. [2022-02-20 18:30:35,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:35,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:35,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 998 states, 997 states have (on average 1.5255767301905716) internal successors, (1521), 997 states have internal predecessors, (1521), 0 states have call successors, (0), 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 1008 states. [2022-02-20 18:30:35,594 INFO L87 Difference]: Start difference. First operand has 998 states, 997 states have (on average 1.5255767301905716) internal successors, (1521), 997 states have internal predecessors, (1521), 0 states have call successors, (0), 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 1008 states. [2022-02-20 18:30:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:35,624 INFO L93 Difference]: Finished difference Result 1008 states and 1530 transitions. [2022-02-20 18:30:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1530 transitions. [2022-02-20 18:30:35,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:35,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:35,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:35,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.5255767301905716) internal successors, (1521), 997 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1521 transitions. [2022-02-20 18:30:35,660 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1521 transitions. Word has length 92 [2022-02-20 18:30:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:35,661 INFO L470 AbstractCegarLoop]: Abstraction has 998 states and 1521 transitions. [2022-02-20 18:30:35,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1521 transitions. [2022-02-20 18:30:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:30:35,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:35,662 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, 1] [2022-02-20 18:30:35,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:30:35,662 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1535391214, now seen corresponding path program 1 times [2022-02-20 18:30:35,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:35,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029910697] [2022-02-20 18:30:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:35,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {20832#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(34, 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; {20832#true} is VALID [2022-02-20 18:30:35,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {20832#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20832#true} is VALID [2022-02-20 18:30:35,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {20832#true} assume 0 == ~r1~0 % 256; {20832#true} is VALID [2022-02-20 18:30:35,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {20832#true} assume ~id1~0 >= 0; {20832#true} is VALID [2022-02-20 18:30:35,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {20832#true} assume 0 == ~st1~0; {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume ~send1~0 == ~id1~0; {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume 0 == ~mode1~0 % 256; {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume ~id2~0 >= 0; {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {20834#(and (or (<= 0 ~st1~0) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume 0 == ~st2~0; {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {20835#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume ~send3~0 == ~id3~0; {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume 0 == ~mode3~0 % 256; {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume ~id4~0 >= 0; {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {20836#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))) (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume 0 == ~st4~0; {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume ~send4~0 == ~id4~0; {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume 0 == ~mode4~0 % 256; {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume ~id5~0 >= 0; {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:35,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {20837#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)))} assume 0 == ~st5~0; {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} assume ~send5~0 == ~id5~0; {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~mode5~0 % 256; {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} assume ~id6~0 >= 0; {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:35,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {20838#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~st6~0; {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} is VALID [2022-02-20 18:30:35,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} assume ~send6~0 == ~id6~0; {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} is VALID [2022-02-20 18:30:35,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} assume 0 == ~mode6~0 % 256; {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} is VALID [2022-02-20 18:30:35,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} assume ~id7~0 >= 0; {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} is VALID [2022-02-20 18:30:35,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0)) (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1))))} assume 0 == ~st7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~send7~0 == ~id7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume 0 == ~mode7~0 % 256; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id1~0 != ~id2~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id1~0 != ~id3~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id1~0 != ~id4~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id1~0 != ~id5~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id1~0 != ~id6~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id1~0 != ~id7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id2~0 != ~id3~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id2~0 != ~id4~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id2~0 != ~id5~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id2~0 != ~id6~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id2~0 != ~id7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id3~0 != ~id4~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id3~0 != ~id5~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id3~0 != ~id6~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id3~0 != ~id7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id4~0 != ~id5~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id4~0 != ~id6~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id4~0 != ~id7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id5~0 != ~id6~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume ~id5~0 != ~id7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} init_#res#1 := init_~tmp~0#1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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;main_~i2~0#1 := 0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode1~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite4#1 := ~send1~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode2~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite5#1 := ~send2~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,972 INFO L290 TraceCheckUtils]: 63: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode3~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite6#1 := ~send3~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode4~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite7#1 := ~send4~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode5~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite8#1 := ~send5~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,977 INFO L290 TraceCheckUtils]: 75: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,977 INFO L290 TraceCheckUtils]: 76: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,978 INFO L290 TraceCheckUtils]: 77: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode6~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,978 INFO L290 TraceCheckUtils]: 78: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite9#1 := ~send6~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,978 INFO L290 TraceCheckUtils]: 79: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,979 INFO L290 TraceCheckUtils]: 80: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,979 INFO L290 TraceCheckUtils]: 81: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 != ~mode7~0 % 256); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,980 INFO L290 TraceCheckUtils]: 82: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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~ite10#1 := ~send7~0; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,980 INFO L290 TraceCheckUtils]: 83: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,981 INFO L290 TraceCheckUtils]: 84: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,981 INFO L290 TraceCheckUtils]: 85: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~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; {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(~r1~0 % 256 >= 7); {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:35,982 INFO L290 TraceCheckUtils]: 87: Hoare triple {20840#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0);check_~tmp~1#1 := 0; {20833#false} is VALID [2022-02-20 18:30:35,982 INFO L290 TraceCheckUtils]: 88: Hoare triple {20833#false} check_#res#1 := check_~tmp~1#1; {20833#false} is VALID [2022-02-20 18:30:35,982 INFO L290 TraceCheckUtils]: 89: Hoare triple {20833#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {20833#false} is VALID [2022-02-20 18:30:35,982 INFO L290 TraceCheckUtils]: 90: Hoare triple {20833#false} assume 0 == assert_~arg#1 % 256; {20833#false} is VALID [2022-02-20 18:30:35,982 INFO L290 TraceCheckUtils]: 91: Hoare triple {20833#false} assume !false; {20833#false} is VALID [2022-02-20 18:30:35,983 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 18:30:35,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:35,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029910697] [2022-02-20 18:30:35,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029910697] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:35,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:35,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:30:35,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026978832] [2022-02-20 18:30:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:35,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:35,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:36,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:36,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:30:36,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:30:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:30:36,049 INFO L87 Difference]: Start difference. First operand 998 states and 1521 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:37,703 INFO L93 Difference]: Finished difference Result 1942 states and 2987 transitions. [2022-02-20 18:30:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:30:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 387 transitions. [2022-02-20 18:30:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 387 transitions. [2022-02-20 18:30:37,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 387 transitions. [2022-02-20 18:30:37,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:37,990 INFO L225 Difference]: With dead ends: 1942 [2022-02-20 18:30:37,990 INFO L226 Difference]: Without dead ends: 1000 [2022-02-20 18:30:37,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:30:37,991 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 834 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:37,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 828 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-02-20 18:30:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2022-02-20 18:30:38,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:38,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1000 states. Second operand has 998 states, 997 states have (on average 1.5175526579739218) internal successors, (1513), 997 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,397 INFO L74 IsIncluded]: Start isIncluded. First operand 1000 states. Second operand has 998 states, 997 states have (on average 1.5175526579739218) internal successors, (1513), 997 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,398 INFO L87 Difference]: Start difference. First operand 1000 states. Second operand has 998 states, 997 states have (on average 1.5175526579739218) internal successors, (1513), 997 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:38,443 INFO L93 Difference]: Finished difference Result 1000 states and 1514 transitions. [2022-02-20 18:30:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1514 transitions. [2022-02-20 18:30:38,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:38,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:38,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 998 states, 997 states have (on average 1.5175526579739218) internal successors, (1513), 997 states have internal predecessors, (1513), 0 states have call successors, (0), 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 1000 states. [2022-02-20 18:30:38,457 INFO L87 Difference]: Start difference. First operand has 998 states, 997 states have (on average 1.5175526579739218) internal successors, (1513), 997 states have internal predecessors, (1513), 0 states have call successors, (0), 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 1000 states. [2022-02-20 18:30:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:38,502 INFO L93 Difference]: Finished difference Result 1000 states and 1514 transitions. [2022-02-20 18:30:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1514 transitions. [2022-02-20 18:30:38,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:38,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:38,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:38,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.5175526579739218) internal successors, (1513), 997 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1513 transitions. [2022-02-20 18:30:38,537 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1513 transitions. Word has length 92 [2022-02-20 18:30:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:38,538 INFO L470 AbstractCegarLoop]: Abstraction has 998 states and 1513 transitions. [2022-02-20 18:30:38,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1513 transitions. [2022-02-20 18:30:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:30:38,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:38,539 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, 1] [2022-02-20 18:30:38,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:30:38,539 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash 550533322, now seen corresponding path program 1 times [2022-02-20 18:30:38,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:38,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118500988] [2022-02-20 18:30:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {26263#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(34, 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; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {26263#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {26263#true} assume 0 == ~r1~0 % 256; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {26263#true} assume ~id1~0 >= 0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {26263#true} assume 0 == ~st1~0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {26263#true} assume ~send1~0 == ~id1~0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {26263#true} assume 0 == ~mode1~0 % 256; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {26263#true} assume ~id2~0 >= 0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {26263#true} assume 0 == ~st2~0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {26263#true} assume ~send2~0 == ~id2~0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {26263#true} assume 0 == ~mode2~0 % 256; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {26263#true} assume ~id3~0 >= 0; {26263#true} is VALID [2022-02-20 18:30:38,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {26263#true} assume 0 == ~st3~0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {26263#true} assume ~send3~0 == ~id3~0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {26263#true} assume 0 == ~mode3~0 % 256; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {26263#true} assume ~id4~0 >= 0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {26263#true} assume 0 == ~st4~0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {26263#true} assume ~send4~0 == ~id4~0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {26263#true} assume 0 == ~mode4~0 % 256; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {26263#true} assume ~id5~0 >= 0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {26263#true} assume 0 == ~st5~0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {26263#true} assume ~send5~0 == ~id5~0; {26263#true} is VALID [2022-02-20 18:30:38,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {26263#true} assume 0 == ~mode5~0 % 256; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {26265#(= (+ (* (- 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;main_~i2~0#1 := 0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,628 INFO L290 TraceCheckUtils]: 71: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,628 INFO L290 TraceCheckUtils]: 72: Hoare triple {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {26265#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:38,628 INFO L290 TraceCheckUtils]: 73: Hoare triple {26265#(= (+ (* (- 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; {26264#false} is VALID [2022-02-20 18:30:38,628 INFO L290 TraceCheckUtils]: 74: Hoare triple {26264#false} assume node5_~m5~0#1 != ~nomsg~0; {26264#false} is VALID [2022-02-20 18:30:38,628 INFO L290 TraceCheckUtils]: 75: Hoare triple {26264#false} assume !(node5_~m5~0#1 > ~id5~0); {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 76: Hoare triple {26264#false} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 77: Hoare triple {26264#false} ~mode5~0 := 0; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 78: Hoare triple {26264#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 79: Hoare triple {26264#false} assume !(0 != ~mode6~0 % 256); {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {26264#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 81: Hoare triple {26264#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 82: Hoare triple {26264#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 83: Hoare triple {26264#false} assume !(0 != ~mode7~0 % 256); {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 84: Hoare triple {26264#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 85: Hoare triple {26264#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 86: Hoare triple {26264#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; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 87: Hoare triple {26264#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 88: Hoare triple {26264#false} check_#res#1 := check_~tmp~1#1; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 89: Hoare triple {26264#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 90: Hoare triple {26264#false} assume 0 == assert_~arg#1 % 256; {26264#false} is VALID [2022-02-20 18:30:38,629 INFO L290 TraceCheckUtils]: 91: Hoare triple {26264#false} assume !false; {26264#false} is VALID [2022-02-20 18:30:38,629 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 18:30:38,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:38,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118500988] [2022-02-20 18:30:38,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118500988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:38,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:38,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:38,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625421808] [2022-02-20 18:30:38,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:38,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:38,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:38,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:38,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:38,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:38,694 INFO L87 Difference]: Start difference. First operand 998 states and 1513 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:40,159 INFO L93 Difference]: Finished difference Result 2786 states and 4267 transitions. [2022-02-20 18:30:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:40,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 379 transitions. [2022-02-20 18:30:40,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:40,537 INFO L225 Difference]: With dead ends: 2786 [2022-02-20 18:30:40,537 INFO L226 Difference]: Without dead ends: 1844 [2022-02-20 18:30:40,538 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 18:30:40,539 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 85 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 335 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 18:30:40,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 335 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2022-02-20 18:30:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2022-02-20 18:30:41,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:41,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1844 states. Second operand has 1842 states, 1841 states have (on average 1.5171102661596958) internal successors, (2793), 1841 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:41,352 INFO L74 IsIncluded]: Start isIncluded. First operand 1844 states. Second operand has 1842 states, 1841 states have (on average 1.5171102661596958) internal successors, (2793), 1841 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:41,354 INFO L87 Difference]: Start difference. First operand 1844 states. Second operand has 1842 states, 1841 states have (on average 1.5171102661596958) internal successors, (2793), 1841 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:41,461 INFO L93 Difference]: Finished difference Result 1844 states and 2794 transitions. [2022-02-20 18:30:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2794 transitions. [2022-02-20 18:30:41,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:41,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:41,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 1842 states, 1841 states have (on average 1.5171102661596958) internal successors, (2793), 1841 states have internal predecessors, (2793), 0 states have call successors, (0), 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 1844 states. [2022-02-20 18:30:41,469 INFO L87 Difference]: Start difference. First operand has 1842 states, 1841 states have (on average 1.5171102661596958) internal successors, (2793), 1841 states have internal predecessors, (2793), 0 states have call successors, (0), 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 1844 states. [2022-02-20 18:30:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:41,582 INFO L93 Difference]: Finished difference Result 1844 states and 2794 transitions. [2022-02-20 18:30:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2794 transitions. [2022-02-20 18:30:41,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:41,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:41,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:41,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.5171102661596958) internal successors, (2793), 1841 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2793 transitions. [2022-02-20 18:30:41,716 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2793 transitions. Word has length 92 [2022-02-20 18:30:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:41,716 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 2793 transitions. [2022-02-20 18:30:41,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2793 transitions. [2022-02-20 18:30:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:30:41,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:41,717 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, 1] [2022-02-20 18:30:41,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:30:41,717 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1925362326, now seen corresponding path program 1 times [2022-02-20 18:30:41,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:41,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929939312] [2022-02-20 18:30:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:41,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {35366#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(34, 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; {35366#true} is VALID [2022-02-20 18:30:41,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {35366#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {35366#true} assume 0 == ~r1~0 % 256; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {35366#true} assume ~id1~0 >= 0; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {35366#true} assume 0 == ~st1~0; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {35366#true} assume ~send1~0 == ~id1~0; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {35366#true} assume 0 == ~mode1~0 % 256; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {35366#true} assume ~id2~0 >= 0; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {35366#true} assume 0 == ~st2~0; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {35366#true} assume ~send2~0 == ~id2~0; {35366#true} is VALID [2022-02-20 18:30:41,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {35366#true} assume 0 == ~mode2~0 % 256; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {35366#true} assume ~id3~0 >= 0; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {35366#true} assume 0 == ~st3~0; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {35366#true} assume ~send3~0 == ~id3~0; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {35366#true} assume 0 == ~mode3~0 % 256; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {35366#true} assume ~id4~0 >= 0; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {35366#true} assume 0 == ~st4~0; {35366#true} is VALID [2022-02-20 18:30:41,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {35366#true} assume ~send4~0 == ~id4~0; {35366#true} is VALID [2022-02-20 18:30:41,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {35366#true} assume 0 == ~mode4~0 % 256; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {35368#(= (+ (* (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;main_~i2~0#1 := 0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,809 INFO L290 TraceCheckUtils]: 59: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {35368#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:41,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {35368#(= (+ (* (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; {35367#false} is VALID [2022-02-20 18:30:41,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {35367#false} assume node4_~m4~0#1 != ~nomsg~0; {35367#false} is VALID [2022-02-20 18:30:41,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {35367#false} assume !(node4_~m4~0#1 > ~id4~0); {35367#false} is VALID [2022-02-20 18:30:41,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {35367#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {35367#false} is VALID [2022-02-20 18:30:41,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {35367#false} ~mode4~0 := 0; {35367#false} is VALID [2022-02-20 18:30:41,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {35367#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {35367#false} is VALID [2022-02-20 18:30:41,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {35367#false} assume !(0 != ~mode5~0 % 256); {35367#false} is VALID [2022-02-20 18:30:41,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {35367#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {35367#false} is VALID [2022-02-20 18:30:41,824 INFO L290 TraceCheckUtils]: 77: Hoare triple {35367#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 78: Hoare triple {35367#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 79: Hoare triple {35367#false} assume !(0 != ~mode6~0 % 256); {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 80: Hoare triple {35367#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 81: Hoare triple {35367#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 82: Hoare triple {35367#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 83: Hoare triple {35367#false} assume !(0 != ~mode7~0 % 256); {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 84: Hoare triple {35367#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 85: Hoare triple {35367#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {35367#false} is VALID [2022-02-20 18:30:41,834 INFO L290 TraceCheckUtils]: 86: Hoare triple {35367#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; {35367#false} is VALID [2022-02-20 18:30:41,835 INFO L290 TraceCheckUtils]: 87: Hoare triple {35367#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {35367#false} is VALID [2022-02-20 18:30:41,835 INFO L290 TraceCheckUtils]: 88: Hoare triple {35367#false} check_#res#1 := check_~tmp~1#1; {35367#false} is VALID [2022-02-20 18:30:41,835 INFO L290 TraceCheckUtils]: 89: Hoare triple {35367#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {35367#false} is VALID [2022-02-20 18:30:41,835 INFO L290 TraceCheckUtils]: 90: Hoare triple {35367#false} assume 0 == assert_~arg#1 % 256; {35367#false} is VALID [2022-02-20 18:30:41,835 INFO L290 TraceCheckUtils]: 91: Hoare triple {35367#false} assume !false; {35367#false} is VALID [2022-02-20 18:30:41,835 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 18:30:41,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:41,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929939312] [2022-02-20 18:30:41,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929939312] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:41,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:41,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:41,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427922546] [2022-02-20 18:30:41,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:41,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:41,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:41,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:41,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:41,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:41,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:41,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:41,889 INFO L87 Difference]: Start difference. First operand 1842 states and 2793 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:44,714 INFO L93 Difference]: Finished difference Result 5222 states and 7947 transitions. [2022-02-20 18:30:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:44,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:44,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 379 transitions. [2022-02-20 18:30:44,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:45,311 INFO L225 Difference]: With dead ends: 5222 [2022-02-20 18:30:45,311 INFO L226 Difference]: Without dead ends: 3436 [2022-02-20 18:30:45,313 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 18:30:45,314 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 344 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 18:30:45,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2022-02-20 18:30:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3434. [2022-02-20 18:30:47,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:47,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3436 states. Second operand has 3434 states, 3433 states have (on average 1.5080104864549957) internal successors, (5177), 3433 states have internal predecessors, (5177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,143 INFO L74 IsIncluded]: Start isIncluded. First operand 3436 states. Second operand has 3434 states, 3433 states have (on average 1.5080104864549957) internal successors, (5177), 3433 states have internal predecessors, (5177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,146 INFO L87 Difference]: Start difference. First operand 3436 states. Second operand has 3434 states, 3433 states have (on average 1.5080104864549957) internal successors, (5177), 3433 states have internal predecessors, (5177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:47,576 INFO L93 Difference]: Finished difference Result 3436 states and 5178 transitions. [2022-02-20 18:30:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5178 transitions. [2022-02-20 18:30:47,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:47,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:47,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 3434 states, 3433 states have (on average 1.5080104864549957) internal successors, (5177), 3433 states have internal predecessors, (5177), 0 states have call successors, (0), 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 3436 states. [2022-02-20 18:30:47,614 INFO L87 Difference]: Start difference. First operand has 3434 states, 3433 states have (on average 1.5080104864549957) internal successors, (5177), 3433 states have internal predecessors, (5177), 0 states have call successors, (0), 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 3436 states. [2022-02-20 18:30:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:48,090 INFO L93 Difference]: Finished difference Result 3436 states and 5178 transitions. [2022-02-20 18:30:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5178 transitions. [2022-02-20 18:30:48,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:48,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:48,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:48,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 3433 states have (on average 1.5080104864549957) internal successors, (5177), 3433 states have internal predecessors, (5177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 5177 transitions. [2022-02-20 18:30:48,505 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 5177 transitions. Word has length 92 [2022-02-20 18:30:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:48,505 INFO L470 AbstractCegarLoop]: Abstraction has 3434 states and 5177 transitions. [2022-02-20 18:30:48,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 5177 transitions. [2022-02-20 18:30:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:30:48,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:48,506 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, 1] [2022-02-20 18:30:48,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:30:48,506 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:48,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1745956342, now seen corresponding path program 1 times [2022-02-20 18:30:48,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:48,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973610968] [2022-02-20 18:30:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:48,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {52461#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(34, 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; {52461#true} is VALID [2022-02-20 18:30:48,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {52461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {52461#true} is VALID [2022-02-20 18:30:48,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {52461#true} assume 0 == ~r1~0 % 256; {52461#true} is VALID [2022-02-20 18:30:48,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {52461#true} assume ~id1~0 >= 0; {52461#true} is VALID [2022-02-20 18:30:48,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {52461#true} assume 0 == ~st1~0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {52461#true} assume ~send1~0 == ~id1~0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {52461#true} assume 0 == ~mode1~0 % 256; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {52461#true} assume ~id2~0 >= 0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {52461#true} assume 0 == ~st2~0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {52461#true} assume ~send2~0 == ~id2~0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {52461#true} assume 0 == ~mode2~0 % 256; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {52461#true} assume ~id3~0 >= 0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {52461#true} assume 0 == ~st3~0; {52461#true} is VALID [2022-02-20 18:30:48,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {52461#true} assume ~send3~0 == ~id3~0; {52461#true} is VALID [2022-02-20 18:30:48,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {52461#true} assume 0 == ~mode3~0 % 256; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {52463#(= (+ (* (- 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;main_~i2~0#1 := 0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {52463#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:48,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {52463#(= (+ (* (- 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; {52462#false} is VALID [2022-02-20 18:30:48,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {52462#false} assume node3_~m3~0#1 != ~nomsg~0; {52462#false} is VALID [2022-02-20 18:30:48,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {52462#false} assume !(node3_~m3~0#1 > ~id3~0); {52462#false} is VALID [2022-02-20 18:30:48,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {52462#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {52462#false} is VALID [2022-02-20 18:30:48,587 INFO L290 TraceCheckUtils]: 69: Hoare triple {52462#false} ~mode3~0 := 0; {52462#false} is VALID [2022-02-20 18:30:48,587 INFO L290 TraceCheckUtils]: 70: Hoare triple {52462#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 71: Hoare triple {52462#false} assume !(0 != ~mode4~0 % 256); {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {52462#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {52462#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {52462#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 75: Hoare triple {52462#false} assume !(0 != ~mode5~0 % 256); {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {52462#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {52462#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {52462#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {52462#false} is VALID [2022-02-20 18:30:48,588 INFO L290 TraceCheckUtils]: 79: Hoare triple {52462#false} assume !(0 != ~mode6~0 % 256); {52462#false} is VALID [2022-02-20 18:30:48,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {52462#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {52462#false} is VALID [2022-02-20 18:30:48,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {52462#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {52462#false} is VALID [2022-02-20 18:30:48,589 INFO L290 TraceCheckUtils]: 82: Hoare triple {52462#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {52462#false} is VALID [2022-02-20 18:30:48,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {52462#false} assume !(0 != ~mode7~0 % 256); {52462#false} is VALID [2022-02-20 18:30:48,603 INFO L290 TraceCheckUtils]: 84: Hoare triple {52462#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {52462#false} is VALID [2022-02-20 18:30:48,603 INFO L290 TraceCheckUtils]: 85: Hoare triple {52462#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {52462#false} is VALID [2022-02-20 18:30:48,603 INFO L290 TraceCheckUtils]: 86: Hoare triple {52462#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; {52462#false} is VALID [2022-02-20 18:30:48,603 INFO L290 TraceCheckUtils]: 87: Hoare triple {52462#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {52462#false} is VALID [2022-02-20 18:30:48,603 INFO L290 TraceCheckUtils]: 88: Hoare triple {52462#false} check_#res#1 := check_~tmp~1#1; {52462#false} is VALID [2022-02-20 18:30:48,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {52462#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {52462#false} is VALID [2022-02-20 18:30:48,604 INFO L290 TraceCheckUtils]: 90: Hoare triple {52462#false} assume 0 == assert_~arg#1 % 256; {52462#false} is VALID [2022-02-20 18:30:48,604 INFO L290 TraceCheckUtils]: 91: Hoare triple {52462#false} assume !false; {52462#false} is VALID [2022-02-20 18:30:48,604 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 18:30:48,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:48,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973610968] [2022-02-20 18:30:48,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973610968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:48,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:48,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:48,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834608673] [2022-02-20 18:30:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:48,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:48,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:48,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:48,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:48,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:48,679 INFO L87 Difference]: Start difference. First operand 3434 states and 5177 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:56,329 INFO L93 Difference]: Finished difference Result 9806 states and 14779 transitions. [2022-02-20 18:30:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:30:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:30:56,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 379 transitions. [2022-02-20 18:30:56,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:57,852 INFO L225 Difference]: With dead ends: 9806 [2022-02-20 18:30:57,852 INFO L226 Difference]: Without dead ends: 6428 [2022-02-20 18:30:57,855 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 18:30:57,856 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 93 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 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 18:30:57,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2022-02-20 18:31:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 6426. [2022-02-20 18:31:01,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:01,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6428 states. Second operand has 6426 states, 6425 states have (on average 1.4930739299610896) internal successors, (9593), 6425 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,402 INFO L74 IsIncluded]: Start isIncluded. First operand 6428 states. Second operand has 6426 states, 6425 states have (on average 1.4930739299610896) internal successors, (9593), 6425 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,408 INFO L87 Difference]: Start difference. First operand 6428 states. Second operand has 6426 states, 6425 states have (on average 1.4930739299610896) internal successors, (9593), 6425 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:02,635 INFO L93 Difference]: Finished difference Result 6428 states and 9594 transitions. [2022-02-20 18:31:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6428 states and 9594 transitions. [2022-02-20 18:31:02,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:02,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:02,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 6426 states, 6425 states have (on average 1.4930739299610896) internal successors, (9593), 6425 states have internal predecessors, (9593), 0 states have call successors, (0), 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 6428 states. [2022-02-20 18:31:02,650 INFO L87 Difference]: Start difference. First operand has 6426 states, 6425 states have (on average 1.4930739299610896) internal successors, (9593), 6425 states have internal predecessors, (9593), 0 states have call successors, (0), 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 6428 states. [2022-02-20 18:31:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:03,906 INFO L93 Difference]: Finished difference Result 6428 states and 9594 transitions. [2022-02-20 18:31:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6428 states and 9594 transitions. [2022-02-20 18:31:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:03,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:03,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:03,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6426 states, 6425 states have (on average 1.4930739299610896) internal successors, (9593), 6425 states have internal predecessors, (9593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6426 states to 6426 states and 9593 transitions. [2022-02-20 18:31:05,417 INFO L78 Accepts]: Start accepts. Automaton has 6426 states and 9593 transitions. Word has length 92 [2022-02-20 18:31:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:05,417 INFO L470 AbstractCegarLoop]: Abstraction has 6426 states and 9593 transitions. [2022-02-20 18:31:05,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6426 states and 9593 transitions. [2022-02-20 18:31:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:31:05,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:05,418 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, 1] [2022-02-20 18:31:05,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:31:05,419 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 789382826, now seen corresponding path program 1 times [2022-02-20 18:31:05,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:05,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406427603] [2022-02-20 18:31:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:05,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {84676#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(34, 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; {84676#true} is VALID [2022-02-20 18:31:05,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {84676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {84676#true} assume 0 == ~r1~0 % 256; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {84676#true} assume ~id1~0 >= 0; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {84676#true} assume 0 == ~st1~0; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {84676#true} assume ~send1~0 == ~id1~0; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {84676#true} assume 0 == ~mode1~0 % 256; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {84676#true} assume ~id2~0 >= 0; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {84676#true} assume 0 == ~st2~0; {84676#true} is VALID [2022-02-20 18:31:05,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {84676#true} assume ~send2~0 == ~id2~0; {84676#true} is VALID [2022-02-20 18:31:05,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {84676#true} assume 0 == ~mode2~0 % 256; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,477 INFO L290 TraceCheckUtils]: 58: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,477 INFO L290 TraceCheckUtils]: 59: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {84678#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 62: Hoare triple {84677#false} assume node2_~m2~0#1 != ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 63: Hoare triple {84677#false} assume !(node2_~m2~0#1 > ~id2~0); {84677#false} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 64: Hoare triple {84677#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {84677#false} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 65: Hoare triple {84677#false} ~mode2~0 := 0; {84677#false} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {84677#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {84677#false} assume !(0 != ~mode3~0 % 256); {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 68: Hoare triple {84677#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {84677#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {84677#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 71: Hoare triple {84677#false} assume !(0 != ~mode4~0 % 256); {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 72: Hoare triple {84677#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {84677#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {84677#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {84677#false} assume !(0 != ~mode5~0 % 256); {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {84677#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {84677#false} is VALID [2022-02-20 18:31:05,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {84677#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 78: Hoare triple {84677#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 79: Hoare triple {84677#false} assume !(0 != ~mode6~0 % 256); {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 80: Hoare triple {84677#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 81: Hoare triple {84677#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 82: Hoare triple {84677#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 83: Hoare triple {84677#false} assume !(0 != ~mode7~0 % 256); {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {84677#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {84677#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {84677#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; {84677#false} is VALID [2022-02-20 18:31:05,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {84677#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {84677#false} is VALID [2022-02-20 18:31:05,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {84677#false} check_#res#1 := check_~tmp~1#1; {84677#false} is VALID [2022-02-20 18:31:05,481 INFO L290 TraceCheckUtils]: 89: Hoare triple {84677#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {84677#false} is VALID [2022-02-20 18:31:05,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {84677#false} assume 0 == assert_~arg#1 % 256; {84677#false} is VALID [2022-02-20 18:31:05,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {84677#false} assume !false; {84677#false} is VALID [2022-02-20 18:31:05,481 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 18:31:05,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:05,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406427603] [2022-02-20 18:31:05,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406427603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:05,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:05,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:05,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820468153] [2022-02-20 18:31:05,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:31:05,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:05,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:05,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:05,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:05,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:05,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:05,538 INFO L87 Difference]: Start difference. First operand 6426 states and 9593 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:22,820 INFO L93 Difference]: Finished difference Result 18398 states and 27387 transitions. [2022-02-20 18:31:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:22,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:31:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:31:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2022-02-20 18:31:22,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 379 transitions. [2022-02-20 18:31:22,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:27,246 INFO L225 Difference]: With dead ends: 18398 [2022-02-20 18:31:27,246 INFO L226 Difference]: Without dead ends: 12028 [2022-02-20 18:31:27,251 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 18:31:27,252 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 97 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 362 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 18:31:27,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12028 states. [2022-02-20 18:31:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12028 to 12026. [2022-02-20 18:31:33,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:33,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12028 states. Second operand has 12026 states, 12025 states have (on average 1.4736798336798336) internal successors, (17721), 12025 states have internal predecessors, (17721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,566 INFO L74 IsIncluded]: Start isIncluded. First operand 12028 states. Second operand has 12026 states, 12025 states have (on average 1.4736798336798336) internal successors, (17721), 12025 states have internal predecessors, (17721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:33,573 INFO L87 Difference]: Start difference. First operand 12028 states. Second operand has 12026 states, 12025 states have (on average 1.4736798336798336) internal successors, (17721), 12025 states have internal predecessors, (17721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)