./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:29:55,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:29:55,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:29:55,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:29:55,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:29:55,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:29:55,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:29:55,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:29:55,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:29:55,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:29:55,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:29:55,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:29:55,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:29:55,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:29:55,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:29:55,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:29:55,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:29:55,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:29:55,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:29:55,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:29:55,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:29:55,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:29:55,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:29:55,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:29:55,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:29:55,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:29:55,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:29:55,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:29:55,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:29:55,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:29:55,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:29:55,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:29:55,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:29:55,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:29:55,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:29:55,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:29:55,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:29:55,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:29:55,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:29:55,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:29:55,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:29:55,983 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:29:56,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:29:56,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:29:56,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:29:56,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:29:56,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:29:56,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:29:56,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:29:56,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:29:56,012 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:29:56,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:29:56,013 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:29:56,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:29:56,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:29:56,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:29:56,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:29:56,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:29:56,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:29:56,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:29:56,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:29:56,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:29:56,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:29:56,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:29:56,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:29:56,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:29:56,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:56,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:29:56,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:29:56,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:29:56,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:29:56,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:29:56,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:29:56,016 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:29:56,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:29:56,017 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 -> 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 [2022-02-20 18:29:56,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:29:56,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:29:56,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:29:56,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:29:56,211 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:29:56,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:56,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/568fc133a/cac42363f5c94be5abf54b298d07a87b/FLAG84cebc5ba [2022-02-20 18:29:56,656 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:29:56,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:56,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/568fc133a/cac42363f5c94be5abf54b298d07a87b/FLAG84cebc5ba [2022-02-20 18:29:56,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/568fc133a/cac42363f5c94be5abf54b298d07a87b [2022-02-20 18:29:56,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:29:56,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:29:56,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:56,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:29:56,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:29:56,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1357b4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56, skipping insertion in model container [2022-02-20 18:29:56,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:29:56,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:29:56,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2022-02-20 18:29:56,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:56,879 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:29:56,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2022-02-20 18:29:56,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:29:56,922 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:29:56,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56 WrapperNode [2022-02-20 18:29:56,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:29:56,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:56,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:29:56,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:29:56,928 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:29:56" (1/1) ... [2022-02-20 18:29:56,934 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:29:56" (1/1) ... [2022-02-20 18:29:56,959 INFO L137 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 329 [2022-02-20 18:29:56,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:29:56,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:29:56,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:29:56,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:29:56,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:29:56,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:29:56,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:29:56,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:29:56,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (1/1) ... [2022-02-20 18:29:56,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:29:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:29:57,000 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:29:57,008 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:29:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:29:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:29:57,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:29:57,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:29:57,092 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:29:57,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:29:57,493 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:29:57,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:29:57,498 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:29:57,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:57 BoogieIcfgContainer [2022-02-20 18:29:57,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:29:57,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:29:57,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:29:57,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:29:57,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:29:56" (1/3) ... [2022-02-20 18:29:57,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6539e693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:57, skipping insertion in model container [2022-02-20 18:29:57,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:29:56" (2/3) ... [2022-02-20 18:29:57,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6539e693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:29:57, skipping insertion in model container [2022-02-20 18:29:57,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:29:57" (3/3) ... [2022-02-20 18:29:57,505 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:29:57,508 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:29:57,508 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:29:57,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:29:57,540 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:29:57,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:29:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 92 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:29:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:29:57,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:57,562 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] [2022-02-20 18:29:57,562 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:57,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 8392247, now seen corresponding path program 1 times [2022-02-20 18:29:57,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:57,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082457859] [2022-02-20 18:29:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:57,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {96#true} is VALID [2022-02-20 18:29:57,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {96#true} is VALID [2022-02-20 18:29:57,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {96#true} is VALID [2022-02-20 18:29:57,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {96#true} init_#res#1 := init_~tmp~0#1; {96#true} is VALID [2022-02-20 18:29:57,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {96#true} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {96#true} is VALID [2022-02-20 18:29:57,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {97#false} is VALID [2022-02-20 18:29:57,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {97#false} is VALID [2022-02-20 18:29:57,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {97#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {97#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {97#false} assume !(node1_~m1~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:57,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {97#false} ~mode1~0 := 0; {97#false} is VALID [2022-02-20 18:29:57,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {97#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {97#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {97#false} assume !(node2_~m2~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:57,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {97#false} ~mode2~0 := 0; {97#false} is VALID [2022-02-20 18:29:57,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {97#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {97#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {97#false} assume !(node3_~m3~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:57,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {97#false} ~mode3~0 := 0; {97#false} is VALID [2022-02-20 18:29:57,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {97#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {97#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {97#false} assume !(node4_~m4~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:57,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {97#false} ~mode4~0 := 0; {97#false} is VALID [2022-02-20 18:29:57,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {97#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {97#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {97#false} is VALID [2022-02-20 18:29:57,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {97#false} assume !(node5_~m5~0#1 != ~nomsg~0); {97#false} is VALID [2022-02-20 18:29:57,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {97#false} ~mode5~0 := 0; {97#false} is VALID [2022-02-20 18:29:57,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {97#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {97#false} is VALID [2022-02-20 18:29:57,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {97#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {97#false} is VALID [2022-02-20 18:29:57,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {97#false} check_#res#1 := check_~tmp~1#1; {97#false} is VALID [2022-02-20 18:29:57,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {97#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {97#false} is VALID [2022-02-20 18:29:57,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {97#false} assume 0 == assert_~arg#1 % 256; {97#false} is VALID [2022-02-20 18:29:57,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {97#false} assume !false; {97#false} is VALID [2022-02-20 18:29:57,766 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:29:57,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:57,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082457859] [2022-02-20 18:29:57,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082457859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:57,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:57,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:29:57,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433195865] [2022-02-20 18:29:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:57,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:57,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:57,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:57,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:57,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:29:57,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:29:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:57,831 INFO L87 Difference]: Start difference. First operand has 93 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 92 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:57,934 INFO L93 Difference]: Finished difference Result 146 states and 243 transitions. [2022-02-20 18:29:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:29:57,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 243 transitions. [2022-02-20 18:29:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 243 transitions. [2022-02-20 18:29:57,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 243 transitions. [2022-02-20 18:29:58,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:58,123 INFO L225 Difference]: With dead ends: 146 [2022-02-20 18:29:58,123 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 18:29:58,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:29:58,128 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:58,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 18:29:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 18:29:58,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:58,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:29:58,161 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:29:58,162 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:29:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,169 INFO L93 Difference]: Finished difference Result 89 states and 150 transitions. [2022-02-20 18:29:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2022-02-20 18:29:58,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:58,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:58,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:58,171 INFO L87 Difference]: Start difference. First operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,186 INFO L93 Difference]: Finished difference Result 89 states and 150 transitions. [2022-02-20 18:29:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2022-02-20 18:29:58,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:58,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:58,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:58,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 88 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:29:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 150 transitions. [2022-02-20 18:29:58,192 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 150 transitions. Word has length 33 [2022-02-20 18:29:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:58,193 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 150 transitions. [2022-02-20 18:29:58,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2022-02-20 18:29:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:29:58,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:58,195 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] [2022-02-20 18:29:58,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:29:58,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash -501080843, now seen corresponding path program 1 times [2022-02-20 18:29:58,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:58,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519447154] [2022-02-20 18:29:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:58,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {540#true} is VALID [2022-02-20 18:29:58,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {540#true} is VALID [2022-02-20 18:29:58,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {540#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {542#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:29:58,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {542#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {543#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:29:58,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {543#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {544#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:29:58,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {541#false} is VALID [2022-02-20 18:29:58,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {541#false} is VALID [2022-02-20 18:29:58,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {541#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {541#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {541#false} assume !(node1_~m1~0#1 != ~nomsg~0); {541#false} is VALID [2022-02-20 18:29:58,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#false} ~mode1~0 := 0; {541#false} is VALID [2022-02-20 18:29:58,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#false} assume !(node2_~m2~0#1 != ~nomsg~0); {541#false} is VALID [2022-02-20 18:29:58,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#false} ~mode2~0 := 0; {541#false} is VALID [2022-02-20 18:29:58,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {541#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {541#false} assume !(node3_~m3~0#1 != ~nomsg~0); {541#false} is VALID [2022-02-20 18:29:58,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {541#false} ~mode3~0 := 0; {541#false} is VALID [2022-02-20 18:29:58,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {541#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {541#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#false} assume !(node4_~m4~0#1 != ~nomsg~0); {541#false} is VALID [2022-02-20 18:29:58,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {541#false} ~mode4~0 := 0; {541#false} is VALID [2022-02-20 18:29:58,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {541#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {541#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {541#false} is VALID [2022-02-20 18:29:58,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {541#false} assume !(node5_~m5~0#1 != ~nomsg~0); {541#false} is VALID [2022-02-20 18:29:58,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {541#false} ~mode5~0 := 0; {541#false} is VALID [2022-02-20 18:29:58,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {541#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {541#false} is VALID [2022-02-20 18:29:58,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {541#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {541#false} is VALID [2022-02-20 18:29:58,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {541#false} check_#res#1 := check_~tmp~1#1; {541#false} is VALID [2022-02-20 18:29:58,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {541#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {541#false} is VALID [2022-02-20 18:29:58,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {541#false} assume 0 == assert_~arg#1 % 256; {541#false} is VALID [2022-02-20 18:29:58,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {541#false} assume !false; {541#false} is VALID [2022-02-20 18:29:58,286 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:29:58,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:58,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519447154] [2022-02-20 18:29:58,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519447154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:58,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:58,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:29:58,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682913032] [2022-02-20 18:29:58,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:58,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:58,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:58,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:58,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:29:58,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:29:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:29:58,314 INFO L87 Difference]: Start difference. First operand 89 states and 150 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,588 INFO L93 Difference]: Finished difference Result 145 states and 236 transitions. [2022-02-20 18:29:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:29:58,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 18:29:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2022-02-20 18:29:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2022-02-20 18:29:58,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 236 transitions. [2022-02-20 18:29:58,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:58,747 INFO L225 Difference]: With dead ends: 145 [2022-02-20 18:29:58,747 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 18:29:58,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:29:58,749 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:58,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 558 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 18:29:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 18:29:58,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:58,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:29:58,754 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:29:58,755 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:29:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,757 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2022-02-20 18:29:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-02-20 18:29:58,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:58,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:58,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:58,762 INFO L87 Difference]: Start difference. First operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 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 89 states. [2022-02-20 18:29:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:58,765 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2022-02-20 18:29:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-02-20 18:29:58,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:58,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:58,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:58,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:29:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-02-20 18:29:58,769 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 33 [2022-02-20 18:29:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:58,770 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-02-20 18:29:58,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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:29:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-02-20 18:29:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:58,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:58,772 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:29:58,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:29:58,773 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 988628396, now seen corresponding path program 1 times [2022-02-20 18:29:58,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:58,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370812217] [2022-02-20 18:29:58,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:58,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {990#true} is VALID [2022-02-20 18:29:58,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {990#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {990#true} is VALID [2022-02-20 18:29:58,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {990#true} assume 0 == ~r1~0 % 256; {990#true} is VALID [2022-02-20 18:29:58,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {990#true} assume ~id1~0 >= 0; {990#true} is VALID [2022-02-20 18:29:58,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {990#true} assume 0 == ~st1~0; {990#true} is VALID [2022-02-20 18:29:58,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {990#true} assume ~send1~0 == ~id1~0; {990#true} is VALID [2022-02-20 18:29:58,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {990#true} assume 0 == ~mode1~0 % 256; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:29:58,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {992#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {991#false} assume !(node1_~m1~0#1 != ~nomsg~0); {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {991#false} ~mode1~0 := 0; {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {991#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {991#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {991#false} assume !(node2_~m2~0#1 != ~nomsg~0); {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {991#false} ~mode2~0 := 0; {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {991#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {991#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {991#false} assume !(node3_~m3~0#1 != ~nomsg~0); {991#false} is VALID [2022-02-20 18:29:58,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {991#false} ~mode3~0 := 0; {991#false} is VALID [2022-02-20 18:29:58,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {991#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {991#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {991#false} assume !(node4_~m4~0#1 != ~nomsg~0); {991#false} is VALID [2022-02-20 18:29:58,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {991#false} ~mode4~0 := 0; {991#false} is VALID [2022-02-20 18:29:58,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {991#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {991#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {991#false} is VALID [2022-02-20 18:29:58,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {991#false} assume !(node5_~m5~0#1 != ~nomsg~0); {991#false} is VALID [2022-02-20 18:29:58,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {991#false} ~mode5~0 := 0; {991#false} is VALID [2022-02-20 18:29:58,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {991#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {991#false} is VALID [2022-02-20 18:29:58,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {991#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {991#false} is VALID [2022-02-20 18:29:58,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {991#false} check_#res#1 := check_~tmp~1#1; {991#false} is VALID [2022-02-20 18:29:58,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {991#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {991#false} is VALID [2022-02-20 18:29:58,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {991#false} assume 0 == assert_~arg#1 % 256; {991#false} is VALID [2022-02-20 18:29:58,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {991#false} assume !false; {991#false} is VALID [2022-02-20 18:29:58,899 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:29:58,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:58,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370812217] [2022-02-20 18:29:58,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370812217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:58,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:58,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:58,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266841747] [2022-02-20 18:29:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:58,908 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:29:58,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:58,908 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:29:58,955 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:29:58,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:58,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:58,956 INFO L87 Difference]: Start difference. First operand 89 states and 119 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:29:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:59,086 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2022-02-20 18:29:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:59,086 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:29:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:59,086 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:29:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:59,088 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:29:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:59,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:59,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:59,274 INFO L225 Difference]: With dead ends: 187 [2022-02-20 18:29:59,274 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 18:29:59,274 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:29:59,275 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 72 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:59,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 267 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 18:29:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-02-20 18:29:59,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:59,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have 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:29:59,284 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have 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:29:59,284 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have 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:29:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:59,287 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2022-02-20 18:29:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-02-20 18:29:59,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:59,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:59,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 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 135 states. [2022-02-20 18:29:59,289 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 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 135 states. [2022-02-20 18:29:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:59,291 INFO L93 Difference]: Finished difference Result 135 states and 190 transitions. [2022-02-20 18:29:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 190 transitions. [2022-02-20 18:29:59,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:59,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:59,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:59,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have 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:29:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2022-02-20 18:29:59,296 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 63 [2022-02-20 18:29:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:59,296 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2022-02-20 18:29:59,296 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:29:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2022-02-20 18:29:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:59,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:59,297 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:29:59,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:29:59,298 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash 243045666, now seen corresponding path program 1 times [2022-02-20 18:29:59,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:59,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23361197] [2022-02-20 18:29:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:59,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:59,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {1627#true} is VALID [2022-02-20 18:29:59,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1627#true} is VALID [2022-02-20 18:29:59,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1627#true} assume 0 == ~r1~0 % 256; {1627#true} is VALID [2022-02-20 18:29:59,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {1627#true} assume ~id1~0 >= 0; {1627#true} is VALID [2022-02-20 18:29:59,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {1627#true} assume 0 == ~st1~0; {1627#true} is VALID [2022-02-20 18:29:59,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {1627#true} assume ~send1~0 == ~id1~0; {1627#true} is VALID [2022-02-20 18:29:59,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {1627#true} assume 0 == ~mode1~0 % 256; {1627#true} is VALID [2022-02-20 18:29:59,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {1627#true} assume ~id2~0 >= 0; {1627#true} is VALID [2022-02-20 18:29:59,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#true} assume 0 == ~st2~0; {1627#true} is VALID [2022-02-20 18:29:59,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {1627#true} assume ~send2~0 == ~id2~0; {1627#true} is VALID [2022-02-20 18:29:59,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {1627#true} assume 0 == ~mode2~0 % 256; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:29:59,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {1629#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {1628#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1628#false} is VALID [2022-02-20 18:29:59,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {1628#false} ~mode2~0 := 0; {1628#false} is VALID [2022-02-20 18:29:59,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {1628#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {1628#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {1628#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1628#false} is VALID [2022-02-20 18:29:59,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {1628#false} ~mode3~0 := 0; {1628#false} is VALID [2022-02-20 18:29:59,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {1628#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {1628#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {1628#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1628#false} is VALID [2022-02-20 18:29:59,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {1628#false} ~mode4~0 := 0; {1628#false} is VALID [2022-02-20 18:29:59,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {1628#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {1628#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1628#false} is VALID [2022-02-20 18:29:59,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {1628#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1628#false} is VALID [2022-02-20 18:29:59,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {1628#false} ~mode5~0 := 0; {1628#false} is VALID [2022-02-20 18:29:59,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {1628#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1628#false} is VALID [2022-02-20 18:29:59,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {1628#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1628#false} is VALID [2022-02-20 18:29:59,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {1628#false} check_#res#1 := check_~tmp~1#1; {1628#false} is VALID [2022-02-20 18:29:59,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {1628#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1628#false} is VALID [2022-02-20 18:29:59,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {1628#false} assume 0 == assert_~arg#1 % 256; {1628#false} is VALID [2022-02-20 18:29:59,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {1628#false} assume !false; {1628#false} is VALID [2022-02-20 18:29:59,400 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:29:59,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:59,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23361197] [2022-02-20 18:29:59,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23361197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:59,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:59,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:59,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351995655] [2022-02-20 18:29:59,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:59,403 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:29:59,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:59,403 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:29:59,441 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:29:59,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:59,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:59,442 INFO L87 Difference]: Start difference. First operand 133 states and 189 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:29:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:59,632 INFO L93 Difference]: Finished difference Result 313 states and 473 transitions. [2022-02-20 18:29:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:29:59,632 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:29:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:29:59,632 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:29:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:59,634 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:29:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:29:59,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:29:59,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:29:59,808 INFO L225 Difference]: With dead ends: 313 [2022-02-20 18:29:59,808 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 18:29:59,809 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:29:59,810 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:29:59,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:29:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 18:29:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2022-02-20 18:29:59,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:29:59,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:29:59,823 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:29:59,824 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:29:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:59,828 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2022-02-20 18:29:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2022-02-20 18:29:59,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:59,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:59,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:29:59,830 INFO L87 Difference]: Start difference. First operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:29:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:29:59,834 INFO L93 Difference]: Finished difference Result 217 states and 319 transitions. [2022-02-20 18:29:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2022-02-20 18:29:59,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:29:59,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:29:59,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:29:59,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:29:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:29:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 318 transitions. [2022-02-20 18:29:59,840 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 318 transitions. Word has length 63 [2022-02-20 18:29:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:59,841 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 318 transitions. [2022-02-20 18:29:59,841 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:29:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 318 transitions. [2022-02-20 18:29:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:29:59,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:59,843 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:29:59,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:29:59,843 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:59,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1696985192, now seen corresponding path program 1 times [2022-02-20 18:29:59,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:59,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613216056] [2022-02-20 18:29:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:59,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {2676#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2676#true} assume 0 == ~r1~0 % 256; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {2676#true} assume ~id1~0 >= 0; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {2676#true} assume 0 == ~st1~0; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {2676#true} assume ~send1~0 == ~id1~0; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {2676#true} assume 0 == ~mode1~0 % 256; {2676#true} is VALID [2022-02-20 18:29:59,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {2676#true} assume ~id2~0 >= 0; {2676#true} is VALID [2022-02-20 18:29:59,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {2676#true} assume 0 == ~st2~0; {2676#true} is VALID [2022-02-20 18:29:59,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {2676#true} assume ~send2~0 == ~id2~0; {2676#true} is VALID [2022-02-20 18:29:59,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {2676#true} assume 0 == ~mode2~0 % 256; {2676#true} is VALID [2022-02-20 18:29:59,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {2676#true} assume ~id3~0 >= 0; {2676#true} is VALID [2022-02-20 18:29:59,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {2676#true} assume 0 == ~st3~0; {2676#true} is VALID [2022-02-20 18:29:59,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {2676#true} assume ~send3~0 == ~id3~0; {2676#true} is VALID [2022-02-20 18:29:59,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {2676#true} assume 0 == ~mode3~0 % 256; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:29:59,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {2678#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2677#false} is VALID [2022-02-20 18:29:59,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {2677#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2677#false} is VALID [2022-02-20 18:29:59,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {2677#false} ~mode3~0 := 0; {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {2677#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {2677#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {2677#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {2677#false} ~mode4~0 := 0; {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {2677#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {2677#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {2677#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2677#false} is VALID [2022-02-20 18:29:59,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {2677#false} ~mode5~0 := 0; {2677#false} is VALID [2022-02-20 18:29:59,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {2677#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2677#false} is VALID [2022-02-20 18:29:59,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {2677#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {2677#false} is VALID [2022-02-20 18:29:59,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {2677#false} check_#res#1 := check_~tmp~1#1; {2677#false} is VALID [2022-02-20 18:29:59,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {2677#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2677#false} is VALID [2022-02-20 18:29:59,948 INFO L290 TraceCheckUtils]: 61: Hoare triple {2677#false} assume 0 == assert_~arg#1 % 256; {2677#false} is VALID [2022-02-20 18:29:59,948 INFO L290 TraceCheckUtils]: 62: Hoare triple {2677#false} assume !false; {2677#false} is VALID [2022-02-20 18:29:59,949 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:29:59,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:59,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613216056] [2022-02-20 18:29:59,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613216056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:59,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:59,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:29:59,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984662805] [2022-02-20 18:29:59,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:59,950 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:29:59,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:59,950 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:29:59,986 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:29:59,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:29:59,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:29:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:29:59,987 INFO L87 Difference]: Start difference. First operand 215 states and 318 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:30:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,148 INFO L93 Difference]: Finished difference Result 547 states and 840 transitions. [2022-02-20 18:30:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:00,148 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:30:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:00,148 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:30:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:30:00,150 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:30:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:30:00,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:30:00,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:00,323 INFO L225 Difference]: With dead ends: 547 [2022-02-20 18:30:00,323 INFO L226 Difference]: Without dead ends: 369 [2022-02-20 18:30:00,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:00,325 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 64 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:00,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 265 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-02-20 18:30:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2022-02-20 18:30:00,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:00,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,343 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,343 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,350 INFO L93 Difference]: Finished difference Result 369 states and 555 transitions. [2022-02-20 18:30:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 555 transitions. [2022-02-20 18:30:00,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:00,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:00,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 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 369 states. [2022-02-20 18:30:00,352 INFO L87 Difference]: Start difference. First operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 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 369 states. [2022-02-20 18:30:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,360 INFO L93 Difference]: Finished difference Result 369 states and 555 transitions. [2022-02-20 18:30:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 555 transitions. [2022-02-20 18:30:00,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:00,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:00,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:00,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.5136612021857923) internal successors, (554), 366 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 554 transitions. [2022-02-20 18:30:00,368 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 554 transitions. Word has length 63 [2022-02-20 18:30:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:00,368 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 554 transitions. [2022-02-20 18:30:00,368 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:30:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 554 transitions. [2022-02-20 18:30:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:30:00,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:00,369 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:30:00,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:30:00,369 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1003697422, now seen corresponding path program 1 times [2022-02-20 18:30:00,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:00,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324557793] [2022-02-20 18:30:00,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:00,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {4495#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {4495#true} is VALID [2022-02-20 18:30:00,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {4495#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {4495#true} assume 0 == ~r1~0 % 256; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {4495#true} assume ~id1~0 >= 0; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {4495#true} assume 0 == ~st1~0; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {4495#true} assume ~send1~0 == ~id1~0; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {4495#true} assume 0 == ~mode1~0 % 256; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {4495#true} assume ~id2~0 >= 0; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {4495#true} assume 0 == ~st2~0; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4495#true} assume ~send2~0 == ~id2~0; {4495#true} is VALID [2022-02-20 18:30:00,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {4495#true} assume 0 == ~mode2~0 % 256; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {4495#true} assume ~id3~0 >= 0; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {4495#true} assume 0 == ~st3~0; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {4495#true} assume ~send3~0 == ~id3~0; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {4495#true} assume 0 == ~mode3~0 % 256; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {4495#true} assume ~id4~0 >= 0; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {4495#true} assume 0 == ~st4~0; {4495#true} is VALID [2022-02-20 18:30:00,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {4495#true} assume ~send4~0 == ~id4~0; {4495#true} is VALID [2022-02-20 18:30:00,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {4495#true} assume 0 == ~mode4~0 % 256; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:00,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {4497#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4496#false} is VALID [2022-02-20 18:30:00,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {4496#false} assume !(node4_~m4~0#1 != ~nomsg~0); {4496#false} is VALID [2022-02-20 18:30:00,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {4496#false} ~mode4~0 := 0; {4496#false} is VALID [2022-02-20 18:30:00,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {4496#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {4496#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {4496#false} assume !(node5_~m5~0#1 != ~nomsg~0); {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {4496#false} ~mode5~0 := 0; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {4496#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {4496#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {4496#false} check_#res#1 := check_~tmp~1#1; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {4496#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 61: Hoare triple {4496#false} assume 0 == assert_~arg#1 % 256; {4496#false} is VALID [2022-02-20 18:30:00,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {4496#false} assume !false; {4496#false} is VALID [2022-02-20 18:30:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:00,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:00,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324557793] [2022-02-20 18:30:00,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324557793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:00,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:00,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:00,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031764797] [2022-02-20 18:30:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:00,452 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:30:00,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:00,452 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:30:00,486 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:30:00,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:00,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:00,487 INFO L87 Difference]: Start difference. First operand 367 states and 554 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:30:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,661 INFO L93 Difference]: Finished difference Result 979 states and 1508 transitions. [2022-02-20 18:30:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:00,661 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:30:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:00,661 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:30:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:30:00,663 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:30:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:30:00,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:30:00,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:00,843 INFO L225 Difference]: With dead ends: 979 [2022-02-20 18:30:00,843 INFO L226 Difference]: Without dead ends: 649 [2022-02-20 18:30:00,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:00,844 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 60 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:00,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-02-20 18:30:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2022-02-20 18:30:00,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:00,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,863 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,864 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,877 INFO L93 Difference]: Finished difference Result 649 states and 983 transitions. [2022-02-20 18:30:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 983 transitions. [2022-02-20 18:30:00,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:00,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:00,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 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 649 states. [2022-02-20 18:30:00,880 INFO L87 Difference]: Start difference. First operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 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 649 states. [2022-02-20 18:30:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:00,894 INFO L93 Difference]: Finished difference Result 649 states and 983 transitions. [2022-02-20 18:30:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 983 transitions. [2022-02-20 18:30:00,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:00,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:00,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:00,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.520123839009288) internal successors, (982), 646 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 982 transitions. [2022-02-20 18:30:00,912 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 982 transitions. Word has length 63 [2022-02-20 18:30:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:00,912 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 982 transitions. [2022-02-20 18:30:00,912 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:30:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 982 transitions. [2022-02-20 18:30:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:30:00,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:00,913 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:30:00,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:30:00,913 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1341490564, now seen corresponding path program 1 times [2022-02-20 18:30:00,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:00,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372306153] [2022-02-20 18:30:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:00,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:00,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {7746#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {7746#true} is VALID [2022-02-20 18:30:00,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {7746#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7746#true} is VALID [2022-02-20 18:30:00,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {7746#true} assume 0 == ~r1~0 % 256; {7746#true} is VALID [2022-02-20 18:30:00,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {7746#true} assume ~id1~0 >= 0; {7746#true} is VALID [2022-02-20 18:30:00,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {7746#true} assume 0 == ~st1~0; {7746#true} is VALID [2022-02-20 18:30:00,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {7746#true} assume ~send1~0 == ~id1~0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {7746#true} assume 0 == ~mode1~0 % 256; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {7746#true} assume ~id2~0 >= 0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {7746#true} assume 0 == ~st2~0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {7746#true} assume ~send2~0 == ~id2~0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {7746#true} assume 0 == ~mode2~0 % 256; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {7746#true} assume ~id3~0 >= 0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {7746#true} assume 0 == ~st3~0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {7746#true} assume ~send3~0 == ~id3~0; {7746#true} is VALID [2022-02-20 18:30:00,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {7746#true} assume 0 == ~mode3~0 % 256; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {7746#true} assume ~id4~0 >= 0; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {7746#true} assume 0 == ~st4~0; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {7746#true} assume ~send4~0 == ~id4~0; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {7746#true} assume 0 == ~mode4~0 % 256; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {7746#true} assume ~id5~0 >= 0; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {7746#true} assume 0 == ~st5~0; {7746#true} is VALID [2022-02-20 18:30:00,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {7746#true} assume ~send5~0 == ~id5~0; {7746#true} is VALID [2022-02-20 18:30:00,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {7746#true} assume 0 == ~mode5~0 % 256; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:00,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {7748#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {7747#false} assume !(node5_~m5~0#1 != ~nomsg~0); {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {7747#false} ~mode5~0 := 0; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {7747#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {7747#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {7747#false} check_#res#1 := check_~tmp~1#1; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {7747#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {7747#false} assume 0 == assert_~arg#1 % 256; {7747#false} is VALID [2022-02-20 18:30:00,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {7747#false} assume !false; {7747#false} is VALID [2022-02-20 18:30:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:00,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:00,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372306153] [2022-02-20 18:30:00,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372306153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:00,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:00,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:00,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689223326] [2022-02-20 18:30:00,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:00,987 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:30:00,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:00,991 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:30:01,024 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:30:01,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:01,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:01,025 INFO L87 Difference]: Start difference. First operand 647 states and 982 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:30:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:01,274 INFO L93 Difference]: Finished difference Result 1771 states and 2712 transitions. [2022-02-20 18:30:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:01,275 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:30:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:01,275 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:30:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:30:01,276 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:30:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-02-20 18:30:01,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 273 transitions. [2022-02-20 18:30:01,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:01,471 INFO L225 Difference]: With dead ends: 1771 [2022-02-20 18:30:01,472 INFO L226 Difference]: Without dead ends: 1161 [2022-02-20 18:30:01,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:01,473 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:01,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 263 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-02-20 18:30:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1159. [2022-02-20 18:30:01,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:01,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1161 states. Second operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,511 INFO L74 IsIncluded]: Start isIncluded. First operand 1161 states. Second operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,513 INFO L87 Difference]: Start difference. First operand 1161 states. Second operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:01,551 INFO L93 Difference]: Finished difference Result 1161 states and 1751 transitions. [2022-02-20 18:30:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1751 transitions. [2022-02-20 18:30:01,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:01,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:01,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 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 1161 states. [2022-02-20 18:30:01,556 INFO L87 Difference]: Start difference. First operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 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 1161 states. [2022-02-20 18:30:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:01,595 INFO L93 Difference]: Finished difference Result 1161 states and 1751 transitions. [2022-02-20 18:30:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1751 transitions. [2022-02-20 18:30:01,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:01,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:01,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:01,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.5112262521588946) internal successors, (1750), 1158 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1750 transitions. [2022-02-20 18:30:01,647 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1750 transitions. Word has length 63 [2022-02-20 18:30:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:01,647 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 1750 transitions. [2022-02-20 18:30:01,647 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:30:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1750 transitions. [2022-02-20 18:30:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:30:01,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:01,648 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:30:01,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:30:01,648 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1735491334, now seen corresponding path program 1 times [2022-02-20 18:30:01,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:01,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269605855] [2022-02-20 18:30:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:01,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {13645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {13645#true} is VALID [2022-02-20 18:30:01,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {13645#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {13645#true} is VALID [2022-02-20 18:30:01,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {13645#true} assume 0 == ~r1~0 % 256; {13645#true} is VALID [2022-02-20 18:30:01,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {13645#true} assume ~id1~0 >= 0; {13645#true} is VALID [2022-02-20 18:30:01,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {13645#true} assume 0 == ~st1~0; {13647#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {13647#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {13647#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {13647#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {13647#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {13647#(<= ~st1~0 0)} assume ~id2~0 >= 0; {13647#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:01,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {13647#(<= ~st1~0 0)} assume 0 == ~st2~0; {13648#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {13648#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {13648#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {13648#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {13648#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {13648#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {13648#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {13648#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {13649#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {13650#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:01,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {13651#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {13646#false} is VALID [2022-02-20 18:30:01,757 INFO L290 TraceCheckUtils]: 59: Hoare triple {13646#false} check_#res#1 := check_~tmp~1#1; {13646#false} is VALID [2022-02-20 18:30:01,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {13646#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {13646#false} is VALID [2022-02-20 18:30:01,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {13646#false} assume 0 == assert_~arg#1 % 256; {13646#false} is VALID [2022-02-20 18:30:01,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {13646#false} assume !false; {13646#false} is VALID [2022-02-20 18:30:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:01,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:01,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269605855] [2022-02-20 18:30:01,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269605855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:01,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:01,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:30:01,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091873595] [2022-02-20 18:30:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:01,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:01,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:01,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:30:01,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:30:01,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:30:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:01,796 INFO L87 Difference]: Start difference. First operand 1159 states and 1750 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:10,676 INFO L93 Difference]: Finished difference Result 12379 states and 18880 transitions. [2022-02-20 18:30:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:30:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 939 transitions. [2022-02-20 18:30:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 939 transitions. [2022-02-20 18:30:10,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 939 transitions. [2022-02-20 18:30:11,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 939 edges. 939 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:15,472 INFO L225 Difference]: With dead ends: 12379 [2022-02-20 18:30:15,472 INFO L226 Difference]: Without dead ends: 11257 [2022-02-20 18:30:15,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:30:15,478 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 1317 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:15,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1317 Valid, 953 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2022-02-20 18:30:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 2279. [2022-02-20 18:30:16,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:16,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11257 states. Second operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:16,637 INFO L74 IsIncluded]: Start isIncluded. First operand 11257 states. Second operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:16,641 INFO L87 Difference]: Start difference. First operand 11257 states. Second operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,010 INFO L93 Difference]: Finished difference Result 11257 states and 16847 transitions. [2022-02-20 18:30:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 11257 states and 16847 transitions. [2022-02-20 18:30:20,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 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 11257 states. [2022-02-20 18:30:20,036 INFO L87 Difference]: Start difference. First operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 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 11257 states. [2022-02-20 18:30:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:23,367 INFO L93 Difference]: Finished difference Result 11257 states and 16847 transitions. [2022-02-20 18:30:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11257 states and 16847 transitions. [2022-02-20 18:30:23,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:23,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:23,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:23,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.491659350307287) internal successors, (3398), 2278 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3398 transitions. [2022-02-20 18:30:23,545 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3398 transitions. Word has length 63 [2022-02-20 18:30:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:23,546 INFO L470 AbstractCegarLoop]: Abstraction has 2279 states and 3398 transitions. [2022-02-20 18:30:23,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:30:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3398 transitions. [2022-02-20 18:30:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:30:23,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:23,547 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:30:23,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:30:23,547 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1519410410, now seen corresponding path program 1 times [2022-02-20 18:30:23,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:23,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692980419] [2022-02-20 18:30:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:23,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:23,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {54171#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {54171#true} is VALID [2022-02-20 18:30:23,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {54171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {54171#true} is VALID [2022-02-20 18:30:23,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {54171#true} assume 0 == ~r1~0 % 256; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:23,625 INFO L290 TraceCheckUtils]: 59: Hoare triple {54173#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {54172#false} is VALID [2022-02-20 18:30:23,625 INFO L290 TraceCheckUtils]: 60: Hoare triple {54172#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {54172#false} is VALID [2022-02-20 18:30:23,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {54172#false} check_#res#1 := check_~tmp~1#1; {54172#false} is VALID [2022-02-20 18:30:23,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {54172#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {54172#false} is VALID [2022-02-20 18:30:23,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {54172#false} assume 0 == assert_~arg#1 % 256; {54172#false} is VALID [2022-02-20 18:30:23,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {54172#false} assume !false; {54172#false} is VALID [2022-02-20 18:30:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:23,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:23,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692980419] [2022-02-20 18:30:23,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692980419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:23,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:23,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:23,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619689135] [2022-02-20 18:30:23,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:23,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:23,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:23,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:23,673 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:30:23,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:23,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:23,674 INFO L87 Difference]: Start difference. First operand 2279 states and 3398 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:26,338 INFO L93 Difference]: Finished difference Result 5565 states and 8314 transitions. [2022-02-20 18:30:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-02-20 18:30:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2022-02-20 18:30:26,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 274 transitions. [2022-02-20 18:30:26,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:26,858 INFO L225 Difference]: With dead ends: 5565 [2022-02-20 18:30:26,858 INFO L226 Difference]: Without dead ends: 3323 [2022-02-20 18:30:26,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:26,860 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:26,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 226 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2022-02-20 18:30:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2022-02-20 18:30:28,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:28,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:28,403 INFO L74 IsIncluded]: Start isIncluded. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:28,405 INFO L87 Difference]: Start difference. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:28,704 INFO L93 Difference]: Finished difference Result 3323 states and 4905 transitions. [2022-02-20 18:30:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4905 transitions. [2022-02-20 18:30:28,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:28,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:28,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:28,729 INFO L87 Difference]: Start difference. First operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:29,025 INFO L93 Difference]: Finished difference Result 3323 states and 4905 transitions. [2022-02-20 18:30:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4905 transitions. [2022-02-20 18:30:29,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:29,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:29,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:29,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3320 states have (on average 1.4771084337349398) internal successors, (4904), 3320 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4904 transitions. [2022-02-20 18:30:29,406 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4904 transitions. Word has length 65 [2022-02-20 18:30:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:29,407 INFO L470 AbstractCegarLoop]: Abstraction has 3321 states and 4904 transitions. [2022-02-20 18:30:29,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:30:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4904 transitions. [2022-02-20 18:30:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:30:29,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:29,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:29,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:30:29,408 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1585903922, now seen corresponding path program 1 times [2022-02-20 18:30:29,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:29,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212205701] [2022-02-20 18:30:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:29,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:29,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {71728#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {71728#true} is VALID [2022-02-20 18:30:29,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {71728#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {71728#true} is VALID [2022-02-20 18:30:29,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {71728#true} assume 0 == ~r1~0 % 256; {71728#true} is VALID [2022-02-20 18:30:29,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {71728#true} assume ~id1~0 >= 0; {71728#true} is VALID [2022-02-20 18:30:29,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {71728#true} assume 0 == ~st1~0; {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:30:29,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:30:29,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:30:29,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:30:29,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {71730#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:29,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:29,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:29,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:29,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {71731#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {71732#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:30:29,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {71733#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,626 INFO L290 TraceCheckUtils]: 50: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode4~0 % 256); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,627 INFO L290 TraceCheckUtils]: 52: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,627 INFO L290 TraceCheckUtils]: 53: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode5~0 % 256); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,628 INFO L290 TraceCheckUtils]: 55: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,628 INFO L290 TraceCheckUtils]: 56: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:30:29,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {71734#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);check_~tmp~1#1 := 0; {71729#false} is VALID [2022-02-20 18:30:29,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {71729#false} check_#res#1 := check_~tmp~1#1; {71729#false} is VALID [2022-02-20 18:30:29,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {71729#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {71729#false} is VALID [2022-02-20 18:30:29,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {71729#false} assume 0 == assert_~arg#1 % 256; {71729#false} is VALID [2022-02-20 18:30:29,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {71729#false} assume !false; {71729#false} is VALID [2022-02-20 18:30:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:29,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:29,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212205701] [2022-02-20 18:30:29,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212205701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:29,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:29,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:30:29,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875698708] [2022-02-20 18:30:29,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:29,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:29,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:29,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:29,704 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:30:29,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:30:29,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:29,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:30:29,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:29,705 INFO L87 Difference]: Start difference. First operand 3321 states and 4904 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,466 INFO L93 Difference]: Finished difference Result 6605 states and 9770 transitions. [2022-02-20 18:30:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:30:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 281 transitions. [2022-02-20 18:30:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 281 transitions. [2022-02-20 18:30:33,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 281 transitions. [2022-02-20 18:30:33,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:34,025 INFO L225 Difference]: With dead ends: 6605 [2022-02-20 18:30:34,025 INFO L226 Difference]: Without dead ends: 3323 [2022-02-20 18:30:34,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:30:34,028 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 439 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:34,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 425 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2022-02-20 18:30:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2022-02-20 18:30:35,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:35,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,698 INFO L74 IsIncluded]: Start isIncluded. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,711 INFO L87 Difference]: Start difference. First operand 3323 states. Second operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:35,995 INFO L93 Difference]: Finished difference Result 3323 states and 4857 transitions. [2022-02-20 18:30:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4857 transitions. [2022-02-20 18:30:35,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:35,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:36,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:36,004 INFO L87 Difference]: Start difference. First operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 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 3323 states. [2022-02-20 18:30:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:36,290 INFO L93 Difference]: Finished difference Result 3323 states and 4857 transitions. [2022-02-20 18:30:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4857 transitions. [2022-02-20 18:30:36,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:36,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:36,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:36,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3320 states have (on average 1.4626506024096386) internal successors, (4856), 3320 states have internal predecessors, (4856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4856 transitions. [2022-02-20 18:30:36,651 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4856 transitions. Word has length 65 [2022-02-20 18:30:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:36,651 INFO L470 AbstractCegarLoop]: Abstraction has 3321 states and 4856 transitions. [2022-02-20 18:30:36,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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:30:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4856 transitions. [2022-02-20 18:30:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:30:36,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:36,652 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:30:36,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:30:36,652 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1503658279, now seen corresponding path program 1 times [2022-02-20 18:30:36,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:36,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841246713] [2022-02-20 18:30:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:36,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {90575#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {90575#true} is VALID [2022-02-20 18:30:36,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {90575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {90575#true} is VALID [2022-02-20 18:30:36,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {90575#true} assume 0 == ~r1~0 % 256; {90575#true} is VALID [2022-02-20 18:30:36,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {90575#true} assume ~id1~0 >= 0; {90575#true} is VALID [2022-02-20 18:30:36,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {90575#true} assume 0 == ~st1~0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {90575#true} assume ~send1~0 == ~id1~0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {90575#true} assume 0 == ~mode1~0 % 256; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {90575#true} assume ~id2~0 >= 0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {90575#true} assume 0 == ~st2~0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {90575#true} assume ~send2~0 == ~id2~0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {90575#true} assume 0 == ~mode2~0 % 256; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {90575#true} assume ~id3~0 >= 0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {90575#true} assume 0 == ~st3~0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {90575#true} assume ~send3~0 == ~id3~0; {90575#true} is VALID [2022-02-20 18:30:36,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {90575#true} assume 0 == ~mode3~0 % 256; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {90575#true} assume ~id4~0 >= 0; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {90575#true} assume 0 == ~st4~0; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {90575#true} assume ~send4~0 == ~id4~0; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {90575#true} assume 0 == ~mode4~0 % 256; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {90575#true} assume ~id5~0 >= 0; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {90575#true} assume 0 == ~st5~0; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {90575#true} assume ~send5~0 == ~id5~0; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {90575#true} assume 0 == ~mode5~0 % 256; {90575#true} is VALID [2022-02-20 18:30:36,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {90575#true} assume ~id1~0 != ~id2~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {90575#true} assume ~id1~0 != ~id3~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {90575#true} assume ~id1~0 != ~id4~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {90575#true} assume ~id1~0 != ~id5~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {90575#true} assume ~id2~0 != ~id3~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {90575#true} assume ~id2~0 != ~id4~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {90575#true} assume ~id2~0 != ~id5~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {90575#true} assume ~id3~0 != ~id4~0; {90575#true} is VALID [2022-02-20 18:30:36,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {90575#true} assume ~id3~0 != ~id5~0; {90575#true} is VALID [2022-02-20 18:30:36,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {90575#true} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {90577#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:30:36,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {90577#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {90578#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:30:36,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {90578#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {90579#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {90579#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {90575#true} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {90575#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {90575#true} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {90575#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {90575#true} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {90575#true} assume !(0 != ~mode1~0 % 256); {90575#true} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {90575#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {90575#true} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {90575#true} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {90575#true} is VALID [2022-02-20 18:30:36,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {90575#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {90575#true} assume !(0 != ~mode2~0 % 256); {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {90575#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {90575#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {90575#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {90575#true} assume !(0 != ~mode3~0 % 256); {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {90575#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {90575#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {90575#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {90575#true} assume !(0 != ~mode4~0 % 256); {90575#true} is VALID [2022-02-20 18:30:36,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {90575#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {90575#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {90575#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {90575#true} assume !(0 != ~mode5~0 % 256); {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {90575#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {90575#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {90575#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {90575#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {90575#true} assume !(~r1~0 % 256 >= 5); {90575#true} is VALID [2022-02-20 18:30:36,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {90575#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {90575#true} is VALID [2022-02-20 18:30:36,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {90575#true} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {90580#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:30:36,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {90580#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {90581#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:30:36,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {90581#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {90582#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:30:36,738 INFO L290 TraceCheckUtils]: 64: Hoare triple {90582#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {90576#false} is VALID [2022-02-20 18:30:36,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {90576#false} assume !false; {90576#false} is VALID [2022-02-20 18:30:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:36,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:36,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841246713] [2022-02-20 18:30:36,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841246713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:36,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:36,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:36,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755182352] [2022-02-20 18:30:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:36,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:36,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:36,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:36,795 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:30:36,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:36,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:36,796 INFO L87 Difference]: Start difference. First operand 3321 states and 4856 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:42,572 INFO L93 Difference]: Finished difference Result 6164 states and 8906 transitions. [2022-02-20 18:30:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:30:42,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2022-02-20 18:30:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2022-02-20 18:30:42,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 205 transitions. [2022-02-20 18:30:42,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:44,032 INFO L225 Difference]: With dead ends: 6164 [2022-02-20 18:30:44,032 INFO L226 Difference]: Without dead ends: 6162 [2022-02-20 18:30:44,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:30:44,034 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 628 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:44,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 580 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-02-20 18:30:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 3513. [2022-02-20 18:30:46,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:46,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6162 states. Second operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:46,503 INFO L74 IsIncluded]: Start isIncluded. First operand 6162 states. Second operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:46,505 INFO L87 Difference]: Start difference. First operand 6162 states. Second operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:47,563 INFO L93 Difference]: Finished difference Result 6162 states and 8825 transitions. [2022-02-20 18:30:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 8825 transitions. [2022-02-20 18:30:47,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:47,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:47,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 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 6162 states. [2022-02-20 18:30:47,573 INFO L87 Difference]: Start difference. First operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 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 6162 states. [2022-02-20 18:30:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:48,692 INFO L93 Difference]: Finished difference Result 6162 states and 8825 transitions. [2022-02-20 18:30:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 8825 transitions. [2022-02-20 18:30:48,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:48,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:48,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:48,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 3512 states have (on average 1.4328018223234624) internal successors, (5032), 3512 states have internal predecessors, (5032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 5032 transitions. [2022-02-20 18:30:49,141 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 5032 transitions. Word has length 66 [2022-02-20 18:30:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:49,141 INFO L470 AbstractCegarLoop]: Abstraction has 3513 states and 5032 transitions. [2022-02-20 18:30:49,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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:30:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 5032 transitions. [2022-02-20 18:30:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-20 18:30:49,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:49,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:49,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:30:49,143 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 550206538, now seen corresponding path program 1 times [2022-02-20 18:30:49,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:49,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736774955] [2022-02-20 18:30:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:49,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {114916#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {114916#true} is VALID [2022-02-20 18:30:49,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {114916#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {114916#true} is VALID [2022-02-20 18:30:49,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {114916#true} assume 0 == ~r1~0 % 256; {114916#true} is VALID [2022-02-20 18:30:49,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {114916#true} assume ~id1~0 >= 0; {114916#true} is VALID [2022-02-20 18:30:49,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {114916#true} assume 0 == ~st1~0; {114918#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:49,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {114918#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {114918#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:49,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {114918#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {114918#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:49,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {114918#(<= ~st1~0 0)} assume ~id2~0 >= 0; {114918#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:49,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {114918#(<= ~st1~0 0)} assume 0 == ~st2~0; {114919#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {114919#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {114919#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {114919#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {114919#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {114919#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {114919#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {114919#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {114920#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret30#1 && main_#t~ret30#1 <= 2147483647;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,232 INFO L290 TraceCheckUtils]: 68: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,255 INFO L290 TraceCheckUtils]: 71: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node2_~m2~0#1 != ~nomsg~0); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 != ~nomsg~0); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,258 INFO L290 TraceCheckUtils]: 79: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,258 INFO L290 TraceCheckUtils]: 80: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node4_~m4~0#1 != ~nomsg~0); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,259 INFO L290 TraceCheckUtils]: 83: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume node5_~m5~0#1 != ~nomsg~0; {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,260 INFO L290 TraceCheckUtils]: 85: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(node5_~m5~0#1 > ~id5~0); {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:49,260 INFO L290 TraceCheckUtils]: 86: Hoare triple {114921#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {114922#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:49,261 INFO L290 TraceCheckUtils]: 87: Hoare triple {114922#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0; {114922#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:49,261 INFO L290 TraceCheckUtils]: 88: Hoare triple {114922#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {114922#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:30:49,262 INFO L290 TraceCheckUtils]: 89: Hoare triple {114922#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {114917#false} is VALID [2022-02-20 18:30:49,262 INFO L290 TraceCheckUtils]: 90: Hoare triple {114917#false} check_#res#1 := check_~tmp~1#1; {114917#false} is VALID [2022-02-20 18:30:49,262 INFO L290 TraceCheckUtils]: 91: Hoare triple {114917#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {114917#false} is VALID [2022-02-20 18:30:49,262 INFO L290 TraceCheckUtils]: 92: Hoare triple {114917#false} assume 0 == assert_~arg#1 % 256; {114917#false} is VALID [2022-02-20 18:30:49,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {114917#false} assume !false; {114917#false} is VALID [2022-02-20 18:30:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 18:30:49,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:49,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736774955] [2022-02-20 18:30:49,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736774955] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:49,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:49,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:30:49,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52433100] [2022-02-20 18:30:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 94 [2022-02-20 18:30:49,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:49,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:49,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:49,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:30:49,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:30:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:49,318 INFO L87 Difference]: Start difference. First operand 3513 states and 5032 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)