./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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 d2ba51bdecedc8a39a24625eeb8da910bb1c988071a15f12bed2cd804a9146c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:44,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:44,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:44,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:44,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:44,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:44,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:44,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:44,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:44,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:44,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:44,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:44,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:44,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:44,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:44,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:44,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:44,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:44,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:44,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:44,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:44,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:44,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:44,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:44,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:44,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:44,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:44,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:44,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:44,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:44,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:44,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:44,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:44,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:44,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:44,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:44,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:44,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:44,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:44,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:44,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:44,494 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:51:44,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:44,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:44,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:44,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:44,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:44,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:44,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:44,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:44,530 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:44,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:44,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:44,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:44,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:44,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:44,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:44,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:44,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:44,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:44,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:44,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:44,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:44,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:44,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:44,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:44,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:44,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:44,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:44,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:44,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:44,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:44,535 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:44,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:44,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:44,536 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 -> d2ba51bdecedc8a39a24625eeb8da910bb1c988071a15f12bed2cd804a9146c3 [2022-02-20 18:51:44,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:44,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:44,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:44,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:44,827 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:44,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:51:44,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a578e5148/88704ba6d7ab4f4d91a85ed79ac1453c/FLAGe6f3eef62 [2022-02-20 18:51:45,316 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:45,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:51:45,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a578e5148/88704ba6d7ab4f4d91a85ed79ac1453c/FLAGe6f3eef62 [2022-02-20 18:51:45,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a578e5148/88704ba6d7ab4f4d91a85ed79ac1453c [2022-02-20 18:51:45,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:45,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:45,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:45,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:45,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:45,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:45" (1/1) ... [2022-02-20 18:51:45,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22489024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:45, skipping insertion in model container [2022-02-20 18:51:45,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:45" (1/1) ... [2022-02-20 18:51:45,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:45,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:45,940 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-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6638,6651] [2022-02-20 18:51:45,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:45,998 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:46,047 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-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6638,6651] [2022-02-20 18:51:46,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:46,096 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:46,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46 WrapperNode [2022-02-20 18:51:46,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:46,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:46,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:46,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:46,105 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:51:46" (1/1) ... [2022-02-20 18:51:46,120 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:51:46" (1/1) ... [2022-02-20 18:51:46,182 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 516 [2022-02-20 18:51:46,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:46,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:46,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:46,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:46,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:46,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:46,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:46,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:46,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (1/1) ... [2022-02-20 18:51:46,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:46,263 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:51:46,266 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:51:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:46,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:46,398 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:46,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:47,018 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:47,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:47,029 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:47,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:47 BoogieIcfgContainer [2022-02-20 18:51:47,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:47,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:47,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:47,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:47,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:45" (1/3) ... [2022-02-20 18:51:47,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446a9b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:47, skipping insertion in model container [2022-02-20 18:51:47,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:46" (2/3) ... [2022-02-20 18:51:47,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446a9b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:47, skipping insertion in model container [2022-02-20 18:51:47,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:47" (3/3) ... [2022-02-20 18:51:47,039 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:51:47,044 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:47,044 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:51:47,098 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:47,105 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:51:47,105 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:51:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have 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:51:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:51:47,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:47,149 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] [2022-02-20 18:51:47,149 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1503533793, now seen corresponding path program 1 times [2022-02-20 18:51:47,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:47,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855454833] [2022-02-20 18:51:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:47,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {126#true} is VALID [2022-02-20 18:51:47,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {126#true} is VALID [2022-02-20 18:51:47,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} assume 0 == ~r1~0 % 256; {126#true} is VALID [2022-02-20 18:51:47,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} assume ~id1~0 >= 0; {126#true} is VALID [2022-02-20 18:51:47,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} assume 0 == ~st1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:47,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:47,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:47,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= ~st1~0 0)} assume ~id2~0 >= 0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:47,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~st2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,585 INFO L290 TraceCheckUtils]: 54: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~check__tmp~1#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:47,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {127#false} is VALID [2022-02-20 18:51:47,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {127#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {127#false} is VALID [2022-02-20 18:51:47,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {127#false} assume 0 == main_~assert__arg~1#1 % 256; {127#false} is VALID [2022-02-20 18:51:47,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {127#false} assume !false; {127#false} is VALID [2022-02-20 18:51:47,590 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:51:47,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:47,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855454833] [2022-02-20 18:51:47,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855454833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:47,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:47,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:47,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344032703] [2022-02-20 18:51:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:51:47,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:47,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:51:47,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:47,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:47,684 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.743801652892562) internal successors, (211), 122 states have internal predecessors, (211), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:51:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:49,176 INFO L93 Difference]: Finished difference Result 588 states and 943 transitions. [2022-02-20 18:51:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:51:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:51:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:51:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 943 transitions. [2022-02-20 18:51:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:51:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 943 transitions. [2022-02-20 18:51:49,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 943 transitions. [2022-02-20 18:51:49,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:50,003 INFO L225 Difference]: With dead ends: 588 [2022-02-20 18:51:50,004 INFO L226 Difference]: Without dead ends: 518 [2022-02-20 18:51:50,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:51:50,010 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1055 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:50,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 1117 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-02-20 18:51:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 186. [2022-02-20 18:51:50,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:50,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 518 states. Second operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have 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:51:50,109 INFO L74 IsIncluded]: Start isIncluded. First operand 518 states. Second operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have 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:51:50,110 INFO L87 Difference]: Start difference. First operand 518 states. Second operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have 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:51:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,132 INFO L93 Difference]: Finished difference Result 518 states and 784 transitions. [2022-02-20 18:51:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 784 transitions. [2022-02-20 18:51:50,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:50,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:50,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 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 518 states. [2022-02-20 18:51:50,137 INFO L87 Difference]: Start difference. First operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 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 518 states. [2022-02-20 18:51:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,158 INFO L93 Difference]: Finished difference Result 518 states and 784 transitions. [2022-02-20 18:51:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 784 transitions. [2022-02-20 18:51:50,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:50,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:50,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:50,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4594594594594594) internal successors, (270), 185 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have 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:51:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 270 transitions. [2022-02-20 18:51:50,168 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 270 transitions. Word has length 61 [2022-02-20 18:51:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:50,168 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 270 transitions. [2022-02-20 18:51:50,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:51:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 270 transitions. [2022-02-20 18:51:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:50,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:50,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:50,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:50,171 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -886934908, now seen corresponding path program 1 times [2022-02-20 18:51:50,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:50,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867996173] [2022-02-20 18:51:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:50,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {2211#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {2211#true} is VALID [2022-02-20 18:51:50,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {2211#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {2211#true} is VALID [2022-02-20 18:51:50,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {2211#true} assume 0 == ~r1~0 % 256; {2211#true} is VALID [2022-02-20 18:51:50,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {2211#true} assume ~id1~0 >= 0; {2211#true} is VALID [2022-02-20 18:51:50,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {2211#true} assume 0 == ~st1~0; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:50,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:50,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:50,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {2213#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2213#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:50,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {2213#(<= ~st1~0 0)} assume 0 == ~st2~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {2214#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {2214#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:50,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {2215#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:50,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:50,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:50,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:50,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;~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; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:50,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} havoc main_~check__tmp~1#1; {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:50,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {2216#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {2212#false} is VALID [2022-02-20 18:51:50,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {2212#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2212#false} is VALID [2022-02-20 18:51:50,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {2212#false} assume 0 == main_~assert__arg~1#1 % 256; {2212#false} is VALID [2022-02-20 18:51:50,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {2212#false} assume !false; {2212#false} is VALID [2022-02-20 18:51:50,331 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:51:50,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:50,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867996173] [2022-02-20 18:51:50,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867996173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:50,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:50,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:50,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343314028] [2022-02-20 18:51:50,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:50,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:50,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:50,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:50,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:50,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:50,392 INFO L87 Difference]: Start difference. First operand 186 states and 270 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,547 INFO L93 Difference]: Finished difference Result 664 states and 1021 transitions. [2022-02-20 18:51:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:51,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:51:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:51:51,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 626 transitions. [2022-02-20 18:51:52,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:52,056 INFO L225 Difference]: With dead ends: 664 [2022-02-20 18:51:52,056 INFO L226 Difference]: Without dead ends: 562 [2022-02-20 18:51:52,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:52,058 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 606 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:52,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 838 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-02-20 18:51:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 292. [2022-02-20 18:51:52,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:52,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 562 states. Second operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:51:52,224 INFO L74 IsIncluded]: Start isIncluded. First operand 562 states. Second operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:51:52,225 INFO L87 Difference]: Start difference. First operand 562 states. Second operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:51:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:52,250 INFO L93 Difference]: Finished difference Result 562 states and 859 transitions. [2022-02-20 18:51:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 859 transitions. [2022-02-20 18:51:52,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:52,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:52,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 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 562 states. [2022-02-20 18:51:52,254 INFO L87 Difference]: Start difference. First operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 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 562 states. [2022-02-20 18:51:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:52,273 INFO L93 Difference]: Finished difference Result 562 states and 859 transitions. [2022-02-20 18:51:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 859 transitions. [2022-02-20 18:51:52,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:52,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:52,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:52,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 291 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:51:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 438 transitions. [2022-02-20 18:51:52,284 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 438 transitions. Word has length 63 [2022-02-20 18:51:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:52,285 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 438 transitions. [2022-02-20 18:51:52,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 438 transitions. [2022-02-20 18:51:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:52,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:52,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:52,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:52,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash 497894544, now seen corresponding path program 1 times [2022-02-20 18:51:52,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:52,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195064865] [2022-02-20 18:51:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:52,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {4638#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {4638#true} is VALID [2022-02-20 18:51:52,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {4638#true} is VALID [2022-02-20 18:51:52,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume 0 == ~r1~0 % 256; {4638#true} is VALID [2022-02-20 18:51:52,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {4638#true} assume ~id1~0 >= 0; {4638#true} is VALID [2022-02-20 18:51:52,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {4638#true} assume 0 == ~st1~0; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:52,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {4640#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:52,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {4640#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:52,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {4640#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4640#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:52,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {4640#(<= ~st1~0 0)} assume 0 == ~st2~0; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4641#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {4641#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:52,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {4642#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:51:52,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0;~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; {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:51:52,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} havoc main_~check__tmp~1#1; {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:51:52,469 INFO L290 TraceCheckUtils]: 59: Hoare triple {4643#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {4639#false} is VALID [2022-02-20 18:51:52,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {4639#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {4639#false} is VALID [2022-02-20 18:51:52,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {4639#false} assume 0 == main_~assert__arg~1#1 % 256; {4639#false} is VALID [2022-02-20 18:51:52,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-02-20 18:51:52,473 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:51:52,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:52,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195064865] [2022-02-20 18:51:52,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195064865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:52,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:52,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:52,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789860342] [2022-02-20 18:51:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:52,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:52,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:52,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:52,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:52,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:52,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:52,522 INFO L87 Difference]: Start difference. First operand 292 states and 438 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,622 INFO L93 Difference]: Finished difference Result 765 states and 1181 transitions. [2022-02-20 18:51:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:53,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:51:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2022-02-20 18:51:53,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 626 transitions. [2022-02-20 18:51:54,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:54,105 INFO L225 Difference]: With dead ends: 765 [2022-02-20 18:51:54,106 INFO L226 Difference]: Without dead ends: 663 [2022-02-20 18:51:54,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:54,108 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 687 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:54,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 748 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-02-20 18:51:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 443. [2022-02-20 18:51:54,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:54,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 663 states. Second operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:51:54,390 INFO L74 IsIncluded]: Start isIncluded. First operand 663 states. Second operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:51:54,391 INFO L87 Difference]: Start difference. First operand 663 states. Second operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:51:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:54,411 INFO L93 Difference]: Finished difference Result 663 states and 1019 transitions. [2022-02-20 18:51:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1019 transitions. [2022-02-20 18:51:54,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:54,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:54,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:51:54,415 INFO L87 Difference]: Start difference. First operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:51:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:54,437 INFO L93 Difference]: Finished difference Result 663 states and 1019 transitions. [2022-02-20 18:51:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1019 transitions. [2022-02-20 18:51:54,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:54,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:54,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:54,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.5316742081447965) internal successors, (677), 442 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have 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:51:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 677 transitions. [2022-02-20 18:51:54,454 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 677 transitions. Word has length 63 [2022-02-20 18:51:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:54,454 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 677 transitions. [2022-02-20 18:51:54,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 677 transitions. [2022-02-20 18:51:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:54,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:54,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:54,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:54,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1329115962, now seen corresponding path program 1 times [2022-02-20 18:51:54,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:54,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486472948] [2022-02-20 18:51:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:54,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {7621#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {7621#true} is VALID [2022-02-20 18:51:54,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {7621#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {7621#true} is VALID [2022-02-20 18:51:54,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {7621#true} assume 0 == ~r1~0 % 256; {7621#true} is VALID [2022-02-20 18:51:54,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {7621#true} assume ~id1~0 >= 0; {7621#true} is VALID [2022-02-20 18:51:54,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {7621#true} assume 0 == ~st1~0; {7621#true} is VALID [2022-02-20 18:51:54,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {7621#true} assume ~send1~0 == ~id1~0; {7621#true} is VALID [2022-02-20 18:51:54,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {7621#true} assume 0 == ~mode1~0 % 256; {7621#true} is VALID [2022-02-20 18:51:54,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {7621#true} assume ~id2~0 >= 0; {7621#true} is VALID [2022-02-20 18:51:54,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {7621#true} assume 0 == ~st2~0; {7621#true} is VALID [2022-02-20 18:51:54,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {7621#true} assume ~send2~0 == ~id2~0; {7621#true} is VALID [2022-02-20 18:51:54,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {7621#true} assume 0 == ~mode2~0 % 256; {7621#true} is VALID [2022-02-20 18:51:54,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {7621#true} assume ~id3~0 >= 0; {7621#true} is VALID [2022-02-20 18:51:54,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {7621#true} assume 0 == ~st3~0; {7621#true} is VALID [2022-02-20 18:51:54,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {7621#true} assume ~send3~0 == ~id3~0; {7621#true} is VALID [2022-02-20 18:51:54,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {7621#true} assume 0 == ~mode3~0 % 256; {7621#true} is VALID [2022-02-20 18:51:54,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {7621#true} assume ~id4~0 >= 0; {7621#true} is VALID [2022-02-20 18:51:54,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {7621#true} assume 0 == ~st4~0; {7621#true} is VALID [2022-02-20 18:51:54,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {7621#true} assume ~send4~0 == ~id4~0; {7621#true} is VALID [2022-02-20 18:51:54,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {7621#true} assume 0 == ~mode4~0 % 256; {7621#true} is VALID [2022-02-20 18:51:54,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {7621#true} assume ~id1~0 != ~id2~0; {7621#true} is VALID [2022-02-20 18:51:54,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {7621#true} assume ~id1~0 != ~id3~0; {7621#true} is VALID [2022-02-20 18:51:54,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {7621#true} assume ~id1~0 != ~id4~0; {7621#true} is VALID [2022-02-20 18:51:54,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {7621#true} assume ~id2~0 != ~id3~0; {7621#true} is VALID [2022-02-20 18:51:54,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {7621#true} assume ~id2~0 != ~id4~0; {7621#true} is VALID [2022-02-20 18:51:54,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {7621#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {7621#true} is VALID [2022-02-20 18:51:54,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {7621#true} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {7621#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:51:54,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {7621#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7621#true} is VALID [2022-02-20 18:51:54,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {7621#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {7621#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:51:54,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {7621#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7621#true} is VALID [2022-02-20 18:51:54,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {7621#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {7621#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:51:54,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {7621#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {7621#true} is VALID [2022-02-20 18:51:54,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {7621#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {7621#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {7621#true} is VALID [2022-02-20 18:51:54,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {7621#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {7621#true} is VALID [2022-02-20 18:51:54,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {7621#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {7621#true} is VALID [2022-02-20 18:51:54,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {7621#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7621#true} is VALID [2022-02-20 18:51:54,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {7621#true} assume !(~r1~0 % 256 >= 4); {7621#true} is VALID [2022-02-20 18:51:54,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {7621#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7621#true} is VALID [2022-02-20 18:51:54,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {7621#true} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7621#true} is VALID [2022-02-20 18:51:54,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {7621#true} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {7621#true} assume !(0 == ~mode1~0 % 256); {7621#true} is VALID [2022-02-20 18:51:54,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {7621#true} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {7621#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:51:54,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {7621#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {7621#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {7621#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:51:54,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {7621#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {7621#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {7621#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:51:54,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {7621#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {7621#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7621#true} is VALID [2022-02-20 18:51:54,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {7621#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {7621#true} is VALID [2022-02-20 18:51:54,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {7621#true} ~mode4~0 := 0;~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; {7621#true} is VALID [2022-02-20 18:51:54,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {7621#true} havoc main_~check__tmp~1#1; {7621#true} is VALID [2022-02-20 18:51:54,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {7621#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7621#true} is VALID [2022-02-20 18:51:54,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {7621#true} assume ~r1~0 % 256 >= 4; {7623#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 3)))} is VALID [2022-02-20 18:51:54,572 INFO L290 TraceCheckUtils]: 59: Hoare triple {7623#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 3)))} assume ~r1~0 % 256 < 4;main_~check__tmp~1#1 := 1; {7622#false} is VALID [2022-02-20 18:51:54,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {7622#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {7622#false} is VALID [2022-02-20 18:51:54,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {7622#false} assume 0 == main_~assert__arg~1#1 % 256; {7622#false} is VALID [2022-02-20 18:51:54,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {7622#false} assume !false; {7622#false} is VALID [2022-02-20 18:51:54,573 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:51:54,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:54,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486472948] [2022-02-20 18:51:54,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486472948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:54,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:54,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:54,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420594964] [2022-02-20 18:51:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:54,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:54,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:54,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:54,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:54,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:54,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:54,615 INFO L87 Difference]: Start difference. First operand 443 states and 677 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:55,546 INFO L93 Difference]: Finished difference Result 1102 states and 1714 transitions. [2022-02-20 18:51:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:55,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:51:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:51:55,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:51:55,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:55,808 INFO L225 Difference]: With dead ends: 1102 [2022-02-20 18:51:55,809 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:51:55,811 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:51:55,812 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 68 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:55,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 380 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:51:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 734. [2022-02-20 18:51:56,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:56,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:51:56,392 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:51:56,393 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:51:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,419 INFO L93 Difference]: Finished difference Result 750 states and 1142 transitions. [2022-02-20 18:51:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1142 transitions. [2022-02-20 18:51:56,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:51:56,425 INFO L87 Difference]: Start difference. First operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:51:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,450 INFO L93 Difference]: Finished difference Result 750 states and 1142 transitions. [2022-02-20 18:51:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1142 transitions. [2022-02-20 18:51:56,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:56,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5279672578444747) internal successors, (1120), 733 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:51:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1120 transitions. [2022-02-20 18:51:56,484 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1120 transitions. Word has length 63 [2022-02-20 18:51:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:56,485 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1120 transitions. [2022-02-20 18:51:56,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1120 transitions. [2022-02-20 18:51:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:56,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:56,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:56,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:56,488 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1501695225, now seen corresponding path program 1 times [2022-02-20 18:51:56,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:56,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905351682] [2022-02-20 18:51:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:56,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {11665#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {11665#true} is VALID [2022-02-20 18:51:56,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {11665#true} is VALID [2022-02-20 18:51:56,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {11665#true} assume 0 == ~r1~0 % 256; {11665#true} is VALID [2022-02-20 18:51:56,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {11665#true} assume ~id1~0 >= 0; {11665#true} is VALID [2022-02-20 18:51:56,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {11665#true} assume 0 == ~st1~0; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:56,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:56,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:56,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:56,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {11667#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:56,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:56,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:56,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:56,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {11668#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:56,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:56,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:56,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:56,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {11669#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode1~0 % 256); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode4~0 := 0;~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; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} havoc main_~check__tmp~1#1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 % 256 >= 4); {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:56,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {11670#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {11666#false} is VALID [2022-02-20 18:51:56,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {11666#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {11666#false} is VALID [2022-02-20 18:51:56,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {11666#false} assume 0 == main_~assert__arg~1#1 % 256; {11666#false} is VALID [2022-02-20 18:51:56,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {11666#false} assume !false; {11666#false} is VALID [2022-02-20 18:51:56,743 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:51:56,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:56,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905351682] [2022-02-20 18:51:56,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905351682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:56,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:56,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:56,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240682316] [2022-02-20 18:51:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:56,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:56,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:56,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:56,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:56,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:56,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:56,797 INFO L87 Difference]: Start difference. First operand 734 states and 1120 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:58,232 INFO L93 Difference]: Finished difference Result 1379 states and 2122 transitions. [2022-02-20 18:51:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 352 transitions. [2022-02-20 18:51:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 352 transitions. [2022-02-20 18:51:58,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 352 transitions. [2022-02-20 18:51:58,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:58,483 INFO L225 Difference]: With dead ends: 1379 [2022-02-20 18:51:58,483 INFO L226 Difference]: Without dead ends: 736 [2022-02-20 18:51:58,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:58,485 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 525 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:58,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 526 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-02-20 18:51:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2022-02-20 18:51:59,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:59,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 736 states. Second operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:59,246 INFO L74 IsIncluded]: Start isIncluded. First operand 736 states. Second operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:59,247 INFO L87 Difference]: Start difference. First operand 736 states. Second operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,271 INFO L93 Difference]: Finished difference Result 736 states and 1117 transitions. [2022-02-20 18:51:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1117 transitions. [2022-02-20 18:51:59,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:59,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:59,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 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 736 states. [2022-02-20 18:51:59,276 INFO L87 Difference]: Start difference. First operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 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 736 states. [2022-02-20 18:51:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,300 INFO L93 Difference]: Finished difference Result 736 states and 1117 transitions. [2022-02-20 18:51:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1117 transitions. [2022-02-20 18:51:59,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:59,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:59,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:59,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.5225102319236017) internal successors, (1116), 733 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have 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:51:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1116 transitions. [2022-02-20 18:51:59,343 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1116 transitions. Word has length 63 [2022-02-20 18:51:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:59,344 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1116 transitions. [2022-02-20 18:51:59,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1116 transitions. [2022-02-20 18:51:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:51:59,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:59,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:59,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:59,345 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1505725276, now seen corresponding path program 1 times [2022-02-20 18:51:59,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:59,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269732795] [2022-02-20 18:51:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:59,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {16081#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {16081#true} is VALID [2022-02-20 18:51:59,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {16081#true} is VALID [2022-02-20 18:51:59,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume 0 == ~r1~0 % 256; {16081#true} is VALID [2022-02-20 18:51:59,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {16081#true} assume ~id1~0 >= 0; {16081#true} is VALID [2022-02-20 18:51:59,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {16081#true} assume 0 == ~st1~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {16083#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {16083#(<= ~st1~0 0)} assume ~id2~0 >= 0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~st2~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {16083#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {16083#(<= ~st1~0 0)} assume ~id3~0 >= 0; {16083#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:59,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {16083#(<= ~st1~0 0)} assume 0 == ~st3~0; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {16084#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {16084#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 4); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:59,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {16085#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,486 INFO L290 TraceCheckUtils]: 55: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode4~0 := 0;~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; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} havoc main_~check__tmp~1#1; {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:59,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {16086#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {16082#false} is VALID [2022-02-20 18:51:59,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {16082#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {16082#false} is VALID [2022-02-20 18:51:59,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {16082#false} assume 0 == main_~assert__arg~1#1 % 256; {16082#false} is VALID [2022-02-20 18:51:59,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-02-20 18:51:59,493 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:51:59,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:59,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269732795] [2022-02-20 18:51:59,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269732795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:59,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:59,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:59,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498434513] [2022-02-20 18:51:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:59,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:51:59,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:59,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:59,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:59,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:59,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:59,539 INFO L87 Difference]: Start difference. First operand 734 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:01,485 INFO L93 Difference]: Finished difference Result 1494 states and 2292 transitions. [2022-02-20 18:52:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:01,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:52:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:01,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 625 transitions. [2022-02-20 18:52:01,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:01,989 INFO L225 Difference]: With dead ends: 1494 [2022-02-20 18:52:01,989 INFO L226 Difference]: Without dead ends: 1309 [2022-02-20 18:52:01,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:01,990 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 656 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:01,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 984 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-02-20 18:52:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 928. [2022-02-20 18:52:02,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:02,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1309 states. Second operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have 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:52:02,922 INFO L74 IsIncluded]: Start isIncluded. First operand 1309 states. Second operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have 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:52:02,923 INFO L87 Difference]: Start difference. First operand 1309 states. Second operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have 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:52:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:02,979 INFO L93 Difference]: Finished difference Result 1309 states and 2003 transitions. [2022-02-20 18:52:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2003 transitions. [2022-02-20 18:52:02,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:02,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:02,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 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 1309 states. [2022-02-20 18:52:02,985 INFO L87 Difference]: Start difference. First operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 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 1309 states. [2022-02-20 18:52:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,055 INFO L93 Difference]: Finished difference Result 1309 states and 2003 transitions. [2022-02-20 18:52:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2003 transitions. [2022-02-20 18:52:03,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:03,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.528586839266451) internal successors, (1417), 927 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have 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:52:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1417 transitions. [2022-02-20 18:52:03,096 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1417 transitions. Word has length 63 [2022-02-20 18:52:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:03,096 INFO L470 AbstractCegarLoop]: Abstraction has 928 states and 1417 transitions. [2022-02-20 18:52:03,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1417 transitions. [2022-02-20 18:52:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:52:03,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:03,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:03,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:52:03,099 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:03,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1830608528, now seen corresponding path program 1 times [2022-02-20 18:52:03,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:03,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548194171] [2022-02-20 18:52:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:03,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {22076#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {22076#true} is VALID [2022-02-20 18:52:03,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {22076#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {22076#true} is VALID [2022-02-20 18:52:03,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {22076#true} assume 0 == ~r1~0 % 256; {22076#true} is VALID [2022-02-20 18:52:03,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {22076#true} assume ~id1~0 >= 0; {22076#true} is VALID [2022-02-20 18:52:03,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {22076#true} assume 0 == ~st1~0; {22076#true} is VALID [2022-02-20 18:52:03,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {22076#true} assume ~send1~0 == ~id1~0; {22076#true} is VALID [2022-02-20 18:52:03,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {22076#true} assume 0 == ~mode1~0 % 256; {22076#true} is VALID [2022-02-20 18:52:03,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {22076#true} assume ~id2~0 >= 0; {22076#true} is VALID [2022-02-20 18:52:03,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {22076#true} assume 0 == ~st2~0; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:03,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {22078#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:03,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {22078#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:03,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {22078#(<= ~st2~0 0)} assume ~id3~0 >= 0; {22078#(<= ~st2~0 0)} is VALID [2022-02-20 18:52:03,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {22078#(<= ~st2~0 0)} assume 0 == ~st3~0; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {22079#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {22079#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 4); {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:52:03,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {22080#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0;~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; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} havoc main_~check__tmp~1#1; {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:52:03,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {22081#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {22077#false} is VALID [2022-02-20 18:52:03,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {22077#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {22077#false} is VALID [2022-02-20 18:52:03,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {22077#false} assume 0 == main_~assert__arg~1#1 % 256; {22077#false} is VALID [2022-02-20 18:52:03,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {22077#false} assume !false; {22077#false} is VALID [2022-02-20 18:52:03,218 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:52:03,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:03,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548194171] [2022-02-20 18:52:03,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548194171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:03,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:03,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:52:03,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969554908] [2022-02-20 18:52:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:52:03,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:03,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:52:03,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:52:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:52:03,275 INFO L87 Difference]: Start difference. First operand 928 states and 1417 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:05,754 INFO L93 Difference]: Finished difference Result 1688 states and 2593 transitions. [2022-02-20 18:52:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:52:05,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:52:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions. [2022-02-20 18:52:05,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 625 transitions. [2022-02-20 18:52:06,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:06,245 INFO L225 Difference]: With dead ends: 1688 [2022-02-20 18:52:06,245 INFO L226 Difference]: Without dead ends: 1503 [2022-02-20 18:52:06,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:06,246 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 663 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:06,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 763 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-02-20 18:52:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1122. [2022-02-20 18:52:07,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:07,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1503 states. Second operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have 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:52:07,599 INFO L74 IsIncluded]: Start isIncluded. First operand 1503 states. Second operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have 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:52:07,600 INFO L87 Difference]: Start difference. First operand 1503 states. Second operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have 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:52:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,682 INFO L93 Difference]: Finished difference Result 1503 states and 2304 transitions. [2022-02-20 18:52:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2304 transitions. [2022-02-20 18:52:07,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 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 1503 states. [2022-02-20 18:52:07,688 INFO L87 Difference]: Start difference. First operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 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 1503 states. [2022-02-20 18:52:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:07,768 INFO L93 Difference]: Finished difference Result 1503 states and 2304 transitions. [2022-02-20 18:52:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2304 transitions. [2022-02-20 18:52:07,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:07,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:07,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:07,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5325602140945584) internal successors, (1718), 1121 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have 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:52:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1718 transitions. [2022-02-20 18:52:07,849 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1718 transitions. Word has length 63 [2022-02-20 18:52:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:07,849 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 1718 transitions. [2022-02-20 18:52:07,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1718 transitions. [2022-02-20 18:52:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:52:07,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:07,850 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] [2022-02-20 18:52:07,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:52:07,851 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1584928427, now seen corresponding path program 1 times [2022-02-20 18:52:07,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:07,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513353879] [2022-02-20 18:52:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:07,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {29003#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {29005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {29005#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {29005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {29005#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {29005#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:07,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {29005#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {29006#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:07,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {29006#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {29006#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:52:07,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {29006#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {29007#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:52:07,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {29007#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {29004#false} is VALID [2022-02-20 18:52:07,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {29004#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {29004#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {29004#false} is VALID [2022-02-20 18:52:07,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {29004#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {29004#false} is VALID [2022-02-20 18:52:07,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {29004#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {29004#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {29004#false} is VALID [2022-02-20 18:52:07,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {29004#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {29004#false} is VALID [2022-02-20 18:52:07,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {29004#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {29004#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {29004#false} is VALID [2022-02-20 18:52:07,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {29004#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {29004#false} is VALID [2022-02-20 18:52:07,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {29004#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {29004#false} is VALID [2022-02-20 18:52:07,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {29004#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {29004#false} is VALID [2022-02-20 18:52:07,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {29004#false} assume !(~r1~0 % 256 >= 4); {29004#false} is VALID [2022-02-20 18:52:07,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {29004#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {29004#false} is VALID [2022-02-20 18:52:07,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {29004#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {29004#false} is VALID [2022-02-20 18:52:07,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {29004#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {29004#false} assume !(0 == ~mode1~0 % 256); {29004#false} is VALID [2022-02-20 18:52:07,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {29004#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {29004#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:07,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {29004#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {29004#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {29004#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {29004#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {29004#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {29004#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {29004#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {29004#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29004#false} is VALID [2022-02-20 18:52:07,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {29004#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {29004#false} is VALID [2022-02-20 18:52:07,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {29004#false} ~mode4~0 := 0;~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; {29004#false} is VALID [2022-02-20 18:52:07,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {29004#false} havoc main_~check__tmp~1#1; {29004#false} is VALID [2022-02-20 18:52:07,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {29004#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {29004#false} is VALID [2022-02-20 18:52:07,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {29004#false} assume ~r1~0 % 256 >= 4; {29004#false} is VALID [2022-02-20 18:52:07,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {29004#false} assume !(~r1~0 % 256 < 4); {29004#false} is VALID [2022-02-20 18:52:07,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {29004#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {29004#false} is VALID [2022-02-20 18:52:07,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {29004#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {29004#false} is VALID [2022-02-20 18:52:07,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {29004#false} assume 0 == main_~assert__arg~1#1 % 256; {29004#false} is VALID [2022-02-20 18:52:07,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {29004#false} assume !false; {29004#false} is VALID [2022-02-20 18:52:07,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:52:07,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:07,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513353879] [2022-02-20 18:52:07,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513353879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:07,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:07,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:07,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883168138] [2022-02-20 18:52:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:07,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:07,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:52:07,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:07,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:07,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:07,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:07,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:07,988 INFO L87 Difference]: Start difference. First operand 1122 states and 1718 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:52:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,411 INFO L93 Difference]: Finished difference Result 3264 states and 5032 transitions. [2022-02-20 18:52:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:12,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:52:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:52:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2022-02-20 18:52:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:52:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2022-02-20 18:52:12,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 409 transitions. [2022-02-20 18:52:12,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:12,929 INFO L225 Difference]: With dead ends: 3264 [2022-02-20 18:52:12,929 INFO L226 Difference]: Without dead ends: 2171 [2022-02-20 18:52:12,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:12,931 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 659 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:12,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 148 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-02-20 18:52:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2022-02-20 18:52:16,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:16,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have 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:52:16,560 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have 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:52:16,563 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have 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:52:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,697 INFO L93 Difference]: Finished difference Result 2171 states and 3321 transitions. [2022-02-20 18:52:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3321 transitions. [2022-02-20 18:52:16,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 0 states have call successors, (0), 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 2171 states. [2022-02-20 18:52:16,703 INFO L87 Difference]: Start difference. First operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 0 states have call successors, (0), 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 2171 states. [2022-02-20 18:52:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:16,840 INFO L93 Difference]: Finished difference Result 2171 states and 3321 transitions. [2022-02-20 18:52:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3321 transitions. [2022-02-20 18:52:16,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:16,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:16,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:16,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.5313653136531364) internal successors, (3320), 2168 states have internal predecessors, (3320), 0 states have call successors, (0), 0 states have 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:52:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3320 transitions. [2022-02-20 18:52:17,036 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3320 transitions. Word has length 64 [2022-02-20 18:52:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:17,037 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3320 transitions. [2022-02-20 18:52:17,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:52:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3320 transitions. [2022-02-20 18:52:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:52:17,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:17,038 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] [2022-02-20 18:52:17,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:17,038 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash -747879712, now seen corresponding path program 1 times [2022-02-20 18:52:17,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:17,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919613064] [2022-02-20 18:52:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:17,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {40941#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {40943#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:17,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {40943#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {40944#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:17,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {40944#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {40944#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:17,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {40944#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {40945#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:17,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {40945#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {40942#false} is VALID [2022-02-20 18:52:17,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {40942#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {40942#false} is VALID [2022-02-20 18:52:17,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {40942#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {40942#false} assume !(~r1~0 % 256 >= 4); {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {40942#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {40942#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {40942#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {40942#false} assume !(0 == ~mode1~0 % 256); {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {40942#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {40942#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {40942#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {40942#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {40942#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {40942#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {40942#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {40942#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {40942#false} is VALID [2022-02-20 18:52:17,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {40942#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {40942#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {40942#false} is VALID [2022-02-20 18:52:17,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {40942#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {40942#false} is VALID [2022-02-20 18:52:17,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {40942#false} ~mode4~0 := 0;~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; {40942#false} is VALID [2022-02-20 18:52:17,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {40942#false} havoc main_~check__tmp~1#1; {40942#false} is VALID [2022-02-20 18:52:17,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {40942#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40942#false} is VALID [2022-02-20 18:52:17,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {40942#false} assume ~r1~0 % 256 >= 4; {40942#false} is VALID [2022-02-20 18:52:17,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {40942#false} assume !(~r1~0 % 256 < 4); {40942#false} is VALID [2022-02-20 18:52:17,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {40942#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {40942#false} is VALID [2022-02-20 18:52:17,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {40942#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {40942#false} is VALID [2022-02-20 18:52:17,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {40942#false} assume 0 == main_~assert__arg~1#1 % 256; {40942#false} is VALID [2022-02-20 18:52:17,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {40942#false} assume !false; {40942#false} is VALID [2022-02-20 18:52:17,151 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:52:17,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:17,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919613064] [2022-02-20 18:52:17,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919613064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:17,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:17,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:17,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371423212] [2022-02-20 18:52:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:17,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:17,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:52:17,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:17,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:17,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:17,198 INFO L87 Difference]: Start difference. First operand 2169 states and 3320 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:52:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:22,493 INFO L93 Difference]: Finished difference Result 4297 states and 6596 transitions. [2022-02-20 18:52:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:52:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:52:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-20 18:52:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:52:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-20 18:52:22,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 286 transitions. [2022-02-20 18:52:22,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:22,869 INFO L225 Difference]: With dead ends: 4297 [2022-02-20 18:52:22,870 INFO L226 Difference]: Without dead ends: 2169 [2022-02-20 18:52:22,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:22,873 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 414 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:22,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 115 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2022-02-20 18:52:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2169. [2022-02-20 18:52:27,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:27,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2169 states. Second operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have 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:52:27,212 INFO L74 IsIncluded]: Start isIncluded. First operand 2169 states. Second operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have 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:52:27,214 INFO L87 Difference]: Start difference. First operand 2169 states. Second operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have 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:52:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,402 INFO L93 Difference]: Finished difference Result 2169 states and 3275 transitions. [2022-02-20 18:52:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3275 transitions. [2022-02-20 18:52:27,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 0 states have call successors, (0), 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 2169 states. [2022-02-20 18:52:27,409 INFO L87 Difference]: Start difference. First operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 0 states have call successors, (0), 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 2169 states. [2022-02-20 18:52:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:27,606 INFO L93 Difference]: Finished difference Result 2169 states and 3275 transitions. [2022-02-20 18:52:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3275 transitions. [2022-02-20 18:52:27,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:27,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:27,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:27,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.5106088560885609) internal successors, (3275), 2168 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states have 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:52:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3275 transitions. [2022-02-20 18:52:27,794 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3275 transitions. Word has length 65 [2022-02-20 18:52:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:27,794 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3275 transitions. [2022-02-20 18:52:27,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:52:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3275 transitions. [2022-02-20 18:52:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:27,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:27,795 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] [2022-02-20 18:52:27,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:27,796 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 431205441, now seen corresponding path program 1 times [2022-02-20 18:52:27,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:27,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098914881] [2022-02-20 18:52:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:27,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:27,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {54330#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {54332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:27,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {54332#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {54333#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:27,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {54333#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {54333#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:27,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {54333#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {54334#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:27,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {54334#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {54331#false} is VALID [2022-02-20 18:52:27,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {54331#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {54331#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {54331#false} is VALID [2022-02-20 18:52:27,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {54331#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {54331#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {54331#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {54331#false} assume ~send4~0 != ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {54331#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {54331#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {54331#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {54331#false} assume !(~r1~0 % 256 >= 4); {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {54331#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {54331#false} is VALID [2022-02-20 18:52:27,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {54331#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {54331#false} is VALID [2022-02-20 18:52:27,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {54331#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {54331#false} assume !(0 == ~mode1~0 % 256); {54331#false} is VALID [2022-02-20 18:52:27,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {54331#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {54331#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {54331#false} is VALID [2022-02-20 18:52:27,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {54331#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {54331#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {54331#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {54331#false} is VALID [2022-02-20 18:52:27,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {54331#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {54331#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {54331#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {54331#false} is VALID [2022-02-20 18:52:27,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {54331#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {54331#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {54331#false} is VALID [2022-02-20 18:52:27,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {54331#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {54331#false} is VALID [2022-02-20 18:52:27,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {54331#false} ~mode4~0 := 0;~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; {54331#false} is VALID [2022-02-20 18:52:27,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {54331#false} havoc main_~check__tmp~1#1; {54331#false} is VALID [2022-02-20 18:52:27,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {54331#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {54331#false} is VALID [2022-02-20 18:52:27,889 INFO L290 TraceCheckUtils]: 60: Hoare triple {54331#false} assume ~r1~0 % 256 >= 4; {54331#false} is VALID [2022-02-20 18:52:27,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {54331#false} assume !(~r1~0 % 256 < 4); {54331#false} is VALID [2022-02-20 18:52:27,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {54331#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {54331#false} is VALID [2022-02-20 18:52:27,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {54331#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {54331#false} is VALID [2022-02-20 18:52:27,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {54331#false} assume 0 == main_~assert__arg~1#1 % 256; {54331#false} is VALID [2022-02-20 18:52:27,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {54331#false} assume !false; {54331#false} is VALID [2022-02-20 18:52:27,891 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:52:27,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:27,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098914881] [2022-02-20 18:52:27,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098914881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:27,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:27,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:27,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838368044] [2022-02-20 18:52:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:52:27,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:27,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:27,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:27,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:27,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:27,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:27,944 INFO L87 Difference]: Start difference. First operand 2169 states and 3275 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:33,915 INFO L93 Difference]: Finished difference Result 4305 states and 6516 transitions. [2022-02-20 18:52:33,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:33,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:52:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2022-02-20 18:52:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2022-02-20 18:52:33,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 292 transitions. [2022-02-20 18:52:34,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:34,420 INFO L225 Difference]: With dead ends: 4305 [2022-02-20 18:52:34,421 INFO L226 Difference]: Without dead ends: 2169 [2022-02-20 18:52:34,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:34,424 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 430 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:34,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 99 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2022-02-20 18:52:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2169. [2022-02-20 18:52:39,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:39,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2169 states. Second operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have 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:52:39,609 INFO L74 IsIncluded]: Start isIncluded. First operand 2169 states. Second operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have 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:52:39,611 INFO L87 Difference]: Start difference. First operand 2169 states. Second operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have 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:52:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,745 INFO L93 Difference]: Finished difference Result 2169 states and 3230 transitions. [2022-02-20 18:52:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3230 transitions. [2022-02-20 18:52:39,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:39,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:39,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 0 states have call successors, (0), 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 2169 states. [2022-02-20 18:52:39,750 INFO L87 Difference]: Start difference. First operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 0 states have call successors, (0), 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 2169 states. [2022-02-20 18:52:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:39,877 INFO L93 Difference]: Finished difference Result 2169 states and 3230 transitions. [2022-02-20 18:52:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3230 transitions. [2022-02-20 18:52:39,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:39,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:39,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:39,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4898523985239853) internal successors, (3230), 2168 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have 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:52:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3230 transitions. [2022-02-20 18:52:40,064 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3230 transitions. Word has length 66 [2022-02-20 18:52:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:40,065 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3230 transitions. [2022-02-20 18:52:40,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3230 transitions. [2022-02-20 18:52:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:40,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:40,065 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] [2022-02-20 18:52:40,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:40,066 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1430381312, now seen corresponding path program 1 times [2022-02-20 18:52:40,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:40,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065003978] [2022-02-20 18:52:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:40,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {67729#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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~__return_2904~0 := 0;~__return_2995~0 := 0;~__return_3157~0 := 0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {67731#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:40,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {67731#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {67732#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:40,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {67732#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {67732#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:40,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {67732#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2904~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2904~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {67733#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:40,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {67733#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {67730#false} is VALID [2022-02-20 18:52:40,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {67730#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {67730#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {67730#false} assume ~send4~0 != ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {67730#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {67730#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {67730#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {67730#false} assume !(~r1~0 % 256 >= 4); {67730#false} is VALID [2022-02-20 18:52:40,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {67730#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {67730#false} assume ~r1~0 % 256 < 4;main_~check__tmp~0#1 := 1;~__return_2995~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2995~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {67730#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {67730#false} assume !(0 == ~mode1~0 % 256); {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {67730#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {67730#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {67730#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,149 INFO L290 TraceCheckUtils]: 50: Hoare triple {67730#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {67730#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 52: Hoare triple {67730#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {67730#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {67730#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 55: Hoare triple {67730#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {67730#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {67730#false} is VALID [2022-02-20 18:52:40,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {67730#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {67730#false} is VALID [2022-02-20 18:52:40,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {67730#false} ~mode4~0 := 0;~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; {67730#false} is VALID [2022-02-20 18:52:40,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {67730#false} havoc main_~check__tmp~1#1; {67730#false} is VALID [2022-02-20 18:52:40,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {67730#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {67730#false} is VALID [2022-02-20 18:52:40,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {67730#false} assume ~r1~0 % 256 >= 4; {67730#false} is VALID [2022-02-20 18:52:40,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {67730#false} assume !(~r1~0 % 256 < 4); {67730#false} is VALID [2022-02-20 18:52:40,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {67730#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {67730#false} is VALID [2022-02-20 18:52:40,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {67730#false} ~__return_3157~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3157~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {67730#false} is VALID [2022-02-20 18:52:40,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {67730#false} assume 0 == main_~assert__arg~1#1 % 256; {67730#false} is VALID [2022-02-20 18:52:40,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {67730#false} assume !false; {67730#false} is VALID [2022-02-20 18:52:40,152 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:52:40,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:40,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065003978] [2022-02-20 18:52:40,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065003978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:40,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:40,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:40,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786603996] [2022-02-20 18:52:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:52:40,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:40,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:52:40,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:40,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:40,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:40,201 INFO L87 Difference]: Start difference. First operand 2169 states and 3230 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)