./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.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 890f1e18995284b0a908a97d5deeec0465d64ba29b3115b90de791926566ed26 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:44:44,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:44:44,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:44:44,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:44:44,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:44:44,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:44:44,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:44:44,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:44:44,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:44:44,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:44:44,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:44:44,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:44:44,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:44:44,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:44:44,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:44:44,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:44:44,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:44:44,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:44:44,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:44:44,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:44:44,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:44:44,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:44:44,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:44:44,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:44:44,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:44:44,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:44:44,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:44:44,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:44:44,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:44:44,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:44:44,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:44:44,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:44:44,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:44:44,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:44:44,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:44:44,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:44:44,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:44:44,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:44:44,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:44:44,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:44:44,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:44:44,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 19:44:45,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:44:45,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:44:45,007 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:44:45,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:44:45,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:44:45,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:44:45,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:44:45,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:44:45,016 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:44:45,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:44:45,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:44:45,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:44:45,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:44:45,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:44:45,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:44:45,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:44:45,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:44:45,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:44:45,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:45,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:44:45,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:44:45,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:44:45,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:44:45,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:44:45,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:44:45,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:44:45,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:44:45,021 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 -> 890f1e18995284b0a908a97d5deeec0465d64ba29b3115b90de791926566ed26 [2022-02-20 19:44:45,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:44:45,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:44:45,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:44:45,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:44:45,245 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:44:45,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2022-02-20 19:44:45,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a3644e2/c8caa014321b4cfea17340907f1f5c59/FLAG0c5ff66a1 [2022-02-20 19:44:45,826 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:44:45,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2022-02-20 19:44:45,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a3644e2/c8caa014321b4cfea17340907f1f5c59/FLAG0c5ff66a1 [2022-02-20 19:44:46,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a3644e2/c8caa014321b4cfea17340907f1f5c59 [2022-02-20 19:44:46,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:44:46,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:44:46,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:46,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:44:46,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:44:46,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:46" (1/1) ... [2022-02-20 19:44:46,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2778812b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:46, skipping insertion in model container [2022-02-20 19:44:46,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:44:46" (1/1) ... [2022-02-20 19:44:46,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:44:46,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:44:46,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[11668,11681] [2022-02-20 19:44:46,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[13543,13556] [2022-02-20 19:44:47,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:47,198 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:44:47,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[11668,11681] [2022-02-20 19:44:47,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[13543,13556] [2022-02-20 19:44:47,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:44:47,562 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:44:47,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47 WrapperNode [2022-02-20 19:44:47,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:44:47,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:47,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:44:47,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:44:47,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:47,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:47,983 INFO L137 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5088 [2022-02-20 19:44:47,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:44:47,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:44:47,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:44:47,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:44:47,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:47,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:44:48,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:44:48,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:44:48,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:44:48,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (1/1) ... [2022-02-20 19:44:48,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:44:48,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:44:48,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:44:48,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:44:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:44:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:44:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:44:48,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:44:48,333 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:44:48,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:44:55,094 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:44:55,108 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:44:55,109 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:44:55,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:55 BoogieIcfgContainer [2022-02-20 19:44:55,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:44:55,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:44:55,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:44:55,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:44:55,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:44:46" (1/3) ... [2022-02-20 19:44:55,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23abc337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:55, skipping insertion in model container [2022-02-20 19:44:55,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:44:47" (2/3) ... [2022-02-20 19:44:55,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23abc337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:44:55, skipping insertion in model container [2022-02-20 19:44:55,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:44:55" (3/3) ... [2022-02-20 19:44:55,117 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2022-02-20 19:44:55,121 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:44:55,121 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:44:55,165 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:44:55,179 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:44:55,179 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:44:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 911 states, 908 states have (on average 1.8997797356828194) internal successors, (1725), 910 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 19:44:55,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:44:55,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:44:55,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:44:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:44:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1599021611, now seen corresponding path program 1 times [2022-02-20 19:44:55,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:44:55,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590659842] [2022-02-20 19:44:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:44:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:44:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:44:55,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#(<= 4 ~a5~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#(<= 4 ~a5~0)} assume !(0 != main_#t~nondet47#1);havoc main_#t~nondet47#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet45#1, main2_#t~ret46#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {916#(<= 4 ~a5~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet45#1 && main2_#t~nondet45#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet45#1;havoc main2_#t~nondet45#1; {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {916#(<= 4 ~a5~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret42#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {916#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {916#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {916#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {916#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {916#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {916#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {916#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {916#(<= 4 ~a5~0)} is VALID [2022-02-20 19:44:55,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {916#(<= 4 ~a5~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {915#false} is VALID [2022-02-20 19:44:55,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-02-20 19:44:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:44:55,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:44:55,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590659842] [2022-02-20 19:44:55,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590659842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:44:55,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:44:55,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:44:55,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175508866] [2022-02-20 19:44:55,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:44:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 19:44:55,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:44:55,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:44:55,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:44:55,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:44:55,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:44:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:44:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:44:55,511 INFO L87 Difference]: Start difference. First operand has 911 states, 908 states have (on average 1.8997797356828194) internal successors, (1725), 910 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:00,913 INFO L93 Difference]: Finished difference Result 2538 states and 4880 transitions. [2022-02-20 19:45:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 19:45:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4880 transitions. [2022-02-20 19:45:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4880 transitions. [2022-02-20 19:45:00,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4880 transitions. [2022-02-20 19:45:04,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4880 edges. 4880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:04,706 INFO L225 Difference]: With dead ends: 2538 [2022-02-20 19:45:04,706 INFO L226 Difference]: Without dead ends: 1596 [2022-02-20 19:45:04,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:04,714 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 1035 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:04,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1035 Valid, 311 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:45:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-02-20 19:45:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2022-02-20 19:45:04,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:04,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1596 states, 1594 states have (on average 1.8387703889585947) internal successors, (2931), 1595 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:04,802 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1596 states, 1594 states have (on average 1.8387703889585947) internal successors, (2931), 1595 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:04,804 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1596 states, 1594 states have (on average 1.8387703889585947) internal successors, (2931), 1595 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:04,888 INFO L93 Difference]: Finished difference Result 1596 states and 2931 transitions. [2022-02-20 19:45:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2931 transitions. [2022-02-20 19:45:04,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:04,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:04,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 1596 states, 1594 states have (on average 1.8387703889585947) internal successors, (2931), 1595 states have internal predecessors, (2931), 0 states have call successors, (0), 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 1596 states. [2022-02-20 19:45:04,902 INFO L87 Difference]: Start difference. First operand has 1596 states, 1594 states have (on average 1.8387703889585947) internal successors, (2931), 1595 states have internal predecessors, (2931), 0 states have call successors, (0), 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 1596 states. [2022-02-20 19:45:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:04,981 INFO L93 Difference]: Finished difference Result 1596 states and 2931 transitions. [2022-02-20 19:45:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2931 transitions. [2022-02-20 19:45:04,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:04,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:04,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:04,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.8387703889585947) internal successors, (2931), 1595 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2931 transitions. [2022-02-20 19:45:05,071 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2931 transitions. Word has length 16 [2022-02-20 19:45:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:05,071 INFO L470 AbstractCegarLoop]: Abstraction has 1596 states and 2931 transitions. [2022-02-20 19:45:05,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2931 transitions. [2022-02-20 19:45:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 19:45:05,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:05,075 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] [2022-02-20 19:45:05,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:45:05,075 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1592898568, now seen corresponding path program 1 times [2022-02-20 19:45:05,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:05,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837790300] [2022-02-20 19:45:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:05,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:05,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {8300#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8300#true} is VALID [2022-02-20 19:45:05,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {8300#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {8300#true} is VALID [2022-02-20 19:45:05,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {8300#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8300#true} is VALID [2022-02-20 19:45:05,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {8300#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8302#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:45:05,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {8302#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8303#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:45:05,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {8303#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8304#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:45:05,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {8304#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8301#false} is VALID [2022-02-20 19:45:05,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {8301#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;main1_~i2~0#1 := 0; {8301#false} is VALID [2022-02-20 19:45:05,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {8301#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8301#false} is VALID [2022-02-20 19:45:05,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {8301#false} assume !(0 != ~mode1~0 % 256); {8301#false} is VALID [2022-02-20 19:45:05,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {8301#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8301#false} is VALID [2022-02-20 19:45:05,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {8301#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8301#false} is VALID [2022-02-20 19:45:05,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {8301#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8301#false} is VALID [2022-02-20 19:45:05,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {8301#false} assume !(0 != ~mode2~0 % 256); {8301#false} is VALID [2022-02-20 19:45:05,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {8301#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8301#false} is VALID [2022-02-20 19:45:05,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {8301#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8301#false} is VALID [2022-02-20 19:45:05,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {8301#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8301#false} is VALID [2022-02-20 19:45:05,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {8301#false} assume !(0 != ~mode3~0 % 256); {8301#false} is VALID [2022-02-20 19:45:05,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {8301#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8301#false} is VALID [2022-02-20 19:45:05,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {8301#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {8301#false} is VALID [2022-02-20 19:45:05,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {8301#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8301#false} is VALID [2022-02-20 19:45:05,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {8301#false} assume !(0 != ~mode4~0 % 256); {8301#false} is VALID [2022-02-20 19:45:05,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {8301#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8301#false} is VALID [2022-02-20 19:45:05,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {8301#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8301#false} is VALID [2022-02-20 19:45:05,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {8301#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8301#false} is VALID [2022-02-20 19:45:05,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {8301#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8301#false} is VALID [2022-02-20 19:45:05,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {8301#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8301#false} is VALID [2022-02-20 19:45:05,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {8301#false} ~mode5~0 := 0; {8301#false} is VALID [2022-02-20 19:45:05,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {8301#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; {8301#false} is VALID [2022-02-20 19:45:05,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {8301#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {8301#false} is VALID [2022-02-20 19:45:05,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {8301#false} check_#res#1 := check_~tmp~1#1; {8301#false} is VALID [2022-02-20 19:45:05,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {8301#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8301#false} is VALID [2022-02-20 19:45:05,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {8301#false} assume 0 == assert_~arg#1 % 256; {8301#false} is VALID [2022-02-20 19:45:05,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {8301#false} assume !false; {8301#false} is VALID [2022-02-20 19:45:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:05,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:05,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837790300] [2022-02-20 19:45:05,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837790300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:05,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:05,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:45:05,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902069359] [2022-02-20 19:45:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:05,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:05,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:05,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:05,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:05,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:45:05,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:05,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:45:05,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:45:05,216 INFO L87 Difference]: Start difference. First operand 1596 states and 2931 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:09,059 INFO L93 Difference]: Finished difference Result 1654 states and 3020 transitions. [2022-02-20 19:45:09,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:45:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 19:45:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1681 transitions. [2022-02-20 19:45:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1681 transitions. [2022-02-20 19:45:09,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1681 transitions. [2022-02-20 19:45:10,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1681 edges. 1681 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:10,346 INFO L225 Difference]: With dead ends: 1654 [2022-02-20 19:45:10,346 INFO L226 Difference]: Without dead ends: 1596 [2022-02-20 19:45:10,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:10,348 INFO L933 BasicCegarLoop]: 1590 mSDtfsCounter, 3 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6326 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 19:45:10,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6326 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-02-20 19:45:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2022-02-20 19:45:10,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:10,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1596 states, 1594 states have (on average 1.819322459222083) internal successors, (2900), 1595 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,374 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1596 states, 1594 states have (on average 1.819322459222083) internal successors, (2900), 1595 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,377 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1596 states, 1594 states have (on average 1.819322459222083) internal successors, (2900), 1595 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,447 INFO L93 Difference]: Finished difference Result 1596 states and 2900 transitions. [2022-02-20 19:45:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2900 transitions. [2022-02-20 19:45:10,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:10,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:10,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 1596 states, 1594 states have (on average 1.819322459222083) internal successors, (2900), 1595 states have internal predecessors, (2900), 0 states have call successors, (0), 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 1596 states. [2022-02-20 19:45:10,453 INFO L87 Difference]: Start difference. First operand has 1596 states, 1594 states have (on average 1.819322459222083) internal successors, (2900), 1595 states have internal predecessors, (2900), 0 states have call successors, (0), 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 1596 states. [2022-02-20 19:45:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:10,522 INFO L93 Difference]: Finished difference Result 1596 states and 2900 transitions. [2022-02-20 19:45:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2900 transitions. [2022-02-20 19:45:10,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:10,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:10,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:10,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.819322459222083) internal successors, (2900), 1595 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2900 transitions. [2022-02-20 19:45:10,596 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2900 transitions. Word has length 34 [2022-02-20 19:45:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:10,597 INFO L470 AbstractCegarLoop]: Abstraction has 1596 states and 2900 transitions. [2022-02-20 19:45:10,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2900 transitions. [2022-02-20 19:45:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:10,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:10,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:10,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:45:10,598 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1337087153, now seen corresponding path program 1 times [2022-02-20 19:45:10,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:10,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896422790] [2022-02-20 19:45:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:10,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {14800#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {14800#true} is VALID [2022-02-20 19:45:10,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {14800#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {14800#true} is VALID [2022-02-20 19:45:10,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {14800#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14800#true} is VALID [2022-02-20 19:45:10,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {14800#true} assume 0 == ~r1~0 % 256; {14800#true} is VALID [2022-02-20 19:45:10,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {14800#true} assume ~id1~0 >= 0; {14800#true} is VALID [2022-02-20 19:45:10,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {14800#true} assume 0 == ~st1~0; {14800#true} is VALID [2022-02-20 19:45:10,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {14800#true} assume ~send1~0 == ~id1~0; {14800#true} is VALID [2022-02-20 19:45:10,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {14800#true} assume 0 == ~mode1~0 % 256; {14800#true} is VALID [2022-02-20 19:45:10,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {14800#true} assume ~id2~0 >= 0; {14800#true} is VALID [2022-02-20 19:45:10,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {14800#true} assume 0 == ~st2~0; {14800#true} is VALID [2022-02-20 19:45:10,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {14800#true} assume ~send2~0 == ~id2~0; {14800#true} is VALID [2022-02-20 19:45:10,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {14800#true} assume 0 == ~mode2~0 % 256; {14800#true} is VALID [2022-02-20 19:45:10,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {14800#true} assume ~id3~0 >= 0; {14800#true} is VALID [2022-02-20 19:45:10,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {14800#true} assume 0 == ~st3~0; {14800#true} is VALID [2022-02-20 19:45:10,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {14800#true} assume ~send3~0 == ~id3~0; {14800#true} is VALID [2022-02-20 19:45:10,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {14800#true} assume 0 == ~mode3~0 % 256; {14800#true} is VALID [2022-02-20 19:45:10,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {14800#true} assume ~id4~0 >= 0; {14800#true} is VALID [2022-02-20 19:45:10,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {14800#true} assume 0 == ~st4~0; {14800#true} is VALID [2022-02-20 19:45:10,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {14800#true} assume ~send4~0 == ~id4~0; {14800#true} is VALID [2022-02-20 19:45:10,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {14800#true} assume 0 == ~mode4~0 % 256; {14800#true} is VALID [2022-02-20 19:45:10,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {14800#true} assume ~id5~0 >= 0; {14800#true} is VALID [2022-02-20 19:45:10,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {14800#true} assume 0 == ~st5~0; {14800#true} is VALID [2022-02-20 19:45:10,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {14800#true} assume ~send5~0 == ~id5~0; {14800#true} is VALID [2022-02-20 19:45:10,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {14800#true} assume 0 == ~mode5~0 % 256; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {14802#(= (+ (* (- 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;main1_~i2~0#1 := 0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {14802#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:45:10,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {14802#(= (+ (* (- 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; {14801#false} is VALID [2022-02-20 19:45:10,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {14801#false} assume !(node5_~m5~0#1 != ~nomsg~0); {14801#false} is VALID [2022-02-20 19:45:10,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {14801#false} ~mode5~0 := 0; {14801#false} is VALID [2022-02-20 19:45:10,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {14801#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; {14801#false} is VALID [2022-02-20 19:45:10,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {14801#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {14801#false} is VALID [2022-02-20 19:45:10,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {14801#false} check_#res#1 := check_~tmp~1#1; {14801#false} is VALID [2022-02-20 19:45:10,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {14801#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14801#false} is VALID [2022-02-20 19:45:10,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {14801#false} assume 0 == assert_~arg#1 % 256; {14801#false} is VALID [2022-02-20 19:45:10,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {14801#false} assume !false; {14801#false} is VALID [2022-02-20 19:45:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:10,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:10,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896422790] [2022-02-20 19:45:10,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896422790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:10,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:10,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:10,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827555585] [2022-02-20 19:45:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:10,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:10,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:10,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:10,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:10,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:10,730 INFO L87 Difference]: Start difference. First operand 1596 states and 2900 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:12,409 INFO L93 Difference]: Finished difference Result 1698 states and 3060 transitions. [2022-02-20 19:45:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:12,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions. [2022-02-20 19:45:13,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:13,928 INFO L225 Difference]: With dead ends: 1698 [2022-02-20 19:45:13,928 INFO L226 Difference]: Without dead ends: 1644 [2022-02-20 19:45:13,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:13,929 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1498 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:13,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1676 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2022-02-20 19:45:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1642. [2022-02-20 19:45:13,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:13,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1644 states. Second operand has 1642 states, 1640 states have (on average 1.8128048780487804) internal successors, (2973), 1641 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:13,975 INFO L74 IsIncluded]: Start isIncluded. First operand 1644 states. Second operand has 1642 states, 1640 states have (on average 1.8128048780487804) internal successors, (2973), 1641 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:13,978 INFO L87 Difference]: Start difference. First operand 1644 states. Second operand has 1642 states, 1640 states have (on average 1.8128048780487804) internal successors, (2973), 1641 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:14,052 INFO L93 Difference]: Finished difference Result 1644 states and 2974 transitions. [2022-02-20 19:45:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2974 transitions. [2022-02-20 19:45:14,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:14,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:14,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 1642 states, 1640 states have (on average 1.8128048780487804) internal successors, (2973), 1641 states have internal predecessors, (2973), 0 states have call successors, (0), 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 1644 states. [2022-02-20 19:45:14,058 INFO L87 Difference]: Start difference. First operand has 1642 states, 1640 states have (on average 1.8128048780487804) internal successors, (2973), 1641 states have internal predecessors, (2973), 0 states have call successors, (0), 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 1644 states. [2022-02-20 19:45:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:14,129 INFO L93 Difference]: Finished difference Result 1644 states and 2974 transitions. [2022-02-20 19:45:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2974 transitions. [2022-02-20 19:45:14,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:14,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:14,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:14,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1640 states have (on average 1.8128048780487804) internal successors, (2973), 1641 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2973 transitions. [2022-02-20 19:45:14,216 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2973 transitions. Word has length 64 [2022-02-20 19:45:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:14,217 INFO L470 AbstractCegarLoop]: Abstraction has 1642 states and 2973 transitions. [2022-02-20 19:45:14,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2973 transitions. [2022-02-20 19:45:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:45:14,218 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:14,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:45:14,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:45:14,218 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash -119101755, now seen corresponding path program 1 times [2022-02-20 19:45:14,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:14,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279900507] [2022-02-20 19:45:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:14,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {21495#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21495#true} is VALID [2022-02-20 19:45:14,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {21495#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {21495#true} is VALID [2022-02-20 19:45:14,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {21495#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21495#true} is VALID [2022-02-20 19:45:14,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {21495#true} assume 0 == ~r1~0 % 256; {21495#true} is VALID [2022-02-20 19:45:14,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {21495#true} assume ~id1~0 >= 0; {21495#true} is VALID [2022-02-20 19:45:14,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {21495#true} assume 0 == ~st1~0; {21497#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {21497#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21497#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {21497#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21497#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {21497#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21497#(<= ~st1~0 0)} is VALID [2022-02-20 19:45:14,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {21497#(<= ~st1~0 0)} assume 0 == ~st2~0; {21498#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {21498#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {21498#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {21498#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {21498#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {21498#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {21498#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {21498#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {21499#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {21500#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {21501#(<= (+ ~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;main1_~i2~0#1 := 0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {21501#(<= (+ ~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; {21501#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:45:14,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {21501#(<= (+ ~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; {21496#false} is VALID [2022-02-20 19:45:14,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {21496#false} check_#res#1 := check_~tmp~1#1; {21496#false} is VALID [2022-02-20 19:45:14,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {21496#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21496#false} is VALID [2022-02-20 19:45:14,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {21496#false} assume 0 == assert_~arg#1 % 256; {21496#false} is VALID [2022-02-20 19:45:14,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {21496#false} assume !false; {21496#false} is VALID [2022-02-20 19:45:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:14,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:14,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279900507] [2022-02-20 19:45:14,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279900507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:14,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:14,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:45:14,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657906319] [2022-02-20 19:45:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:14,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:14,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:14,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:14,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:45:14,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:14,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:45:14,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:14,383 INFO L87 Difference]: Start difference. First operand 1642 states and 2973 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:18,615 INFO L93 Difference]: Finished difference Result 2642 states and 4553 transitions. [2022-02-20 19:45:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:45:18,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 19:45:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2411 transitions. [2022-02-20 19:45:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2411 transitions. [2022-02-20 19:45:18,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 2411 transitions. [2022-02-20 19:45:20,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2411 edges. 2411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:20,697 INFO L225 Difference]: With dead ends: 2642 [2022-02-20 19:45:20,697 INFO L226 Difference]: Without dead ends: 2542 [2022-02-20 19:45:20,698 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 19:45:20,699 INFO L933 BasicCegarLoop]: 1555 mSDtfsCounter, 8419 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8419 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:20,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8419 Valid, 2463 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:45:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-02-20 19:45:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1740. [2022-02-20 19:45:20,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:20,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2542 states. Second operand has 1740 states, 1738 states have (on average 1.7986191024165707) internal successors, (3126), 1739 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:20,811 INFO L74 IsIncluded]: Start isIncluded. First operand 2542 states. Second operand has 1740 states, 1738 states have (on average 1.7986191024165707) internal successors, (3126), 1739 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:20,812 INFO L87 Difference]: Start difference. First operand 2542 states. Second operand has 1740 states, 1738 states have (on average 1.7986191024165707) internal successors, (3126), 1739 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:20,972 INFO L93 Difference]: Finished difference Result 2542 states and 4375 transitions. [2022-02-20 19:45:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4375 transitions. [2022-02-20 19:45:20,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:20,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:21,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 1740 states, 1738 states have (on average 1.7986191024165707) internal successors, (3126), 1739 states have internal predecessors, (3126), 0 states have call successors, (0), 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 2542 states. [2022-02-20 19:45:21,007 INFO L87 Difference]: Start difference. First operand has 1740 states, 1738 states have (on average 1.7986191024165707) internal successors, (3126), 1739 states have internal predecessors, (3126), 0 states have call successors, (0), 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 2542 states. [2022-02-20 19:45:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:21,166 INFO L93 Difference]: Finished difference Result 2542 states and 4375 transitions. [2022-02-20 19:45:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4375 transitions. [2022-02-20 19:45:21,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:21,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:21,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:21,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1738 states have (on average 1.7986191024165707) internal successors, (3126), 1739 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 3126 transitions. [2022-02-20 19:45:21,251 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 3126 transitions. Word has length 64 [2022-02-20 19:45:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:21,252 INFO L470 AbstractCegarLoop]: Abstraction has 1740 states and 3126 transitions. [2022-02-20 19:45:21,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 3126 transitions. [2022-02-20 19:45:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:21,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:21,253 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 19:45:21,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:45:21,254 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:21,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash 91634997, now seen corresponding path program 1 times [2022-02-20 19:45:21,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:21,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162673301] [2022-02-20 19:45:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:21,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {31215#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {31215#true} is VALID [2022-02-20 19:45:21,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {31215#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {31215#true} is VALID [2022-02-20 19:45:21,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {31215#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {31215#true} is VALID [2022-02-20 19:45:21,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {31215#true} assume 0 == ~r1~0 % 256; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {31217#(<= ~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;main1_~i2~0#1 := 0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,353 INFO L290 TraceCheckUtils]: 49: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {31217#(<= ~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; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:45:21,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {31217#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {31216#false} is VALID [2022-02-20 19:45:21,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {31216#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {31216#false} is VALID [2022-02-20 19:45:21,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {31216#false} check_#res#1 := check_~tmp~1#1; {31216#false} is VALID [2022-02-20 19:45:21,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {31216#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {31216#false} is VALID [2022-02-20 19:45:21,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {31216#false} assume 0 == assert_~arg#1 % 256; {31216#false} is VALID [2022-02-20 19:45:21,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {31216#false} assume !false; {31216#false} is VALID [2022-02-20 19:45:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:21,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:21,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162673301] [2022-02-20 19:45:21,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162673301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:21,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:21,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:21,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437736299] [2022-02-20 19:45:21,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:21,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:21,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:21,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:21,415 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 19:45:21,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:21,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:21,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:21,416 INFO L87 Difference]: Start difference. First operand 1740 states and 3126 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:23,016 INFO L93 Difference]: Finished difference Result 2114 states and 3710 transitions. [2022-02-20 19:45:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:23,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions. [2022-02-20 19:45:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1722 transitions. [2022-02-20 19:45:23,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1722 transitions. [2022-02-20 19:45:24,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:24,449 INFO L225 Difference]: With dead ends: 2114 [2022-02-20 19:45:24,449 INFO L226 Difference]: Without dead ends: 1916 [2022-02-20 19:45:24,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:24,450 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 1489 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:24,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1489 Valid, 1635 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-02-20 19:45:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1910. [2022-02-20 19:45:24,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:24,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1916 states. Second operand has 1910 states, 1908 states have (on average 1.7735849056603774) internal successors, (3384), 1909 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:24,707 INFO L74 IsIncluded]: Start isIncluded. First operand 1916 states. Second operand has 1910 states, 1908 states have (on average 1.7735849056603774) internal successors, (3384), 1909 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:24,708 INFO L87 Difference]: Start difference. First operand 1916 states. Second operand has 1910 states, 1908 states have (on average 1.7735849056603774) internal successors, (3384), 1909 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:24,803 INFO L93 Difference]: Finished difference Result 1916 states and 3389 transitions. [2022-02-20 19:45:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3389 transitions. [2022-02-20 19:45:24,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:24,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:24,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 1910 states, 1908 states have (on average 1.7735849056603774) internal successors, (3384), 1909 states have internal predecessors, (3384), 0 states have call successors, (0), 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 1916 states. [2022-02-20 19:45:24,808 INFO L87 Difference]: Start difference. First operand has 1910 states, 1908 states have (on average 1.7735849056603774) internal successors, (3384), 1909 states have internal predecessors, (3384), 0 states have call successors, (0), 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 1916 states. [2022-02-20 19:45:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:24,899 INFO L93 Difference]: Finished difference Result 1916 states and 3389 transitions. [2022-02-20 19:45:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3389 transitions. [2022-02-20 19:45:24,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:24,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:24,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:24,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1908 states have (on average 1.7735849056603774) internal successors, (3384), 1909 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 3384 transitions. [2022-02-20 19:45:24,998 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 3384 transitions. Word has length 66 [2022-02-20 19:45:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:24,998 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 3384 transitions. [2022-02-20 19:45:24,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3384 transitions. [2022-02-20 19:45:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:24,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:24,999 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 19:45:24,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:45:24,999 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash 158128509, now seen corresponding path program 1 times [2022-02-20 19:45:25,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:25,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830215067] [2022-02-20 19:45:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:25,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {39254#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {39254#true} is VALID [2022-02-20 19:45:25,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {39254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {39254#true} is VALID [2022-02-20 19:45:25,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {39254#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39254#true} is VALID [2022-02-20 19:45:25,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {39254#true} assume 0 == ~r1~0 % 256; {39254#true} is VALID [2022-02-20 19:45:25,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {39254#true} assume ~id1~0 >= 0; {39254#true} is VALID [2022-02-20 19:45:25,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {39254#true} assume 0 == ~st1~0; {39256#(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 19:45:25,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {39256#(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; {39256#(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 19:45:25,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {39256#(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; {39256#(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 19:45:25,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {39256#(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; {39256#(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 19:45:25,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {39256#(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; {39257#(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 19:45:25,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {39257#(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; {39257#(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 19:45:25,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {39257#(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; {39257#(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 19:45:25,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {39257#(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; {39257#(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 19:45:25,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {39257#(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; {39258#(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 19:45:25,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {39258#(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; {39258#(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 19:45:25,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {39258#(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; {39258#(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 19:45:25,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {39258#(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; {39258#(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 19:45:25,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {39258#(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; {39259#(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 19:45:25,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {39259#(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; {39259#(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 19:45:25,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {39259#(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; {39259#(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 19:45:25,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {39259#(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; {39259#(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 19:45:25,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {39259#(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; {39260#(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 19:45:25,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {39260#(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; {39260#(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 19:45:25,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {39260#(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; {39260#(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 19:45:25,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {39260#(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; {39260#(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 19:45:25,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {39260#(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; {39260#(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 19:45:25,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {39260#(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; {39260#(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 19:45:25,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {39260#(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; {39260#(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 19:45:25,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {39260#(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; {39260#(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 19:45:25,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {39260#(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; {39260#(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 19:45:25,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {39260#(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; {39260#(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 19:45:25,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {39260#(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; {39260#(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 19:45:25,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {39260#(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; {39260#(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 19:45:25,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {39260#(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; {39260#(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 19:45:25,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {39260#(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; {39260#(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 19:45:25,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {39260#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {39260#(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 19:45:25,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {39260#(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); {39260#(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 19:45:25,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {39260#(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;main1_~i2~0#1 := 0; {39260#(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 19:45:25,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {39260#(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~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {39260#(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 19:45:25,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {39260#(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); {39260#(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 19:45:25,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {39260#(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~ite5#1 := ~send1~0; {39260#(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 19:45:25,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {39260#(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~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {39260#(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 19:45:25,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {39260#(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~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {39260#(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 19:45:25,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {39260#(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); {39260#(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 19:45:25,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {39260#(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~ite6#1 := ~send2~0; {39260#(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 19:45:25,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {39260#(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~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {39260#(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 19:45:25,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {39260#(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~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {39260#(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 19:45:25,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {39260#(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); {39260#(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 19:45:25,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {39260#(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~ite7#1 := ~send3~0; {39260#(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 19:45:25,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {39260#(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~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {39260#(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 19:45:25,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {39260#(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~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {39260#(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 19:45:25,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {39260#(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); {39260#(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 19:45:25,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {39260#(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~ite8#1 := ~send4~0; {39260#(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 19:45:25,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {39260#(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~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {39260#(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 19:45:25,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {39260#(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~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {39260#(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 19:45:25,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {39260#(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); {39260#(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 19:45:25,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {39260#(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~ite9#1 := ~send5~0; {39260#(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 19:45:25,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {39260#(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~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {39260#(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 19:45:25,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {39260#(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; {39260#(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 19:45:25,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {39260#(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; {39260#(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 19:45:25,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {39260#(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); {39260#(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 19:45:25,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {39260#(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; {39255#false} is VALID [2022-02-20 19:45:25,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {39255#false} check_#res#1 := check_~tmp~1#1; {39255#false} is VALID [2022-02-20 19:45:25,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {39255#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {39255#false} is VALID [2022-02-20 19:45:25,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {39255#false} assume 0 == assert_~arg#1 % 256; {39255#false} is VALID [2022-02-20 19:45:25,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {39255#false} assume !false; {39255#false} is VALID [2022-02-20 19:45:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:25,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:25,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830215067] [2022-02-20 19:45:25,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830215067] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:25,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:25,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:45:25,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525536469] [2022-02-20 19:45:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:25,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:25,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:25,272 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 19:45:25,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:45:25,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:25,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:45:25,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:45:25,273 INFO L87 Difference]: Start difference. First operand 1910 states and 3384 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:28,254 INFO L93 Difference]: Finished difference Result 2280 states and 3954 transitions. [2022-02-20 19:45:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:45:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1729 transitions. [2022-02-20 19:45:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1729 transitions. [2022-02-20 19:45:28,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1729 transitions. [2022-02-20 19:45:29,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1729 edges. 1729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:29,753 INFO L225 Difference]: With dead ends: 2280 [2022-02-20 19:45:29,754 INFO L226 Difference]: Without dead ends: 1912 [2022-02-20 19:45:29,754 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 19:45:29,755 INFO L933 BasicCegarLoop]: 1568 mSDtfsCounter, 3170 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3170 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:29,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3170 Valid, 1893 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-02-20 19:45:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1910. [2022-02-20 19:45:29,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:29,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1912 states. Second operand has 1910 states, 1908 states have (on average 1.771488469601677) internal successors, (3380), 1909 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:29,996 INFO L74 IsIncluded]: Start isIncluded. First operand 1912 states. Second operand has 1910 states, 1908 states have (on average 1.771488469601677) internal successors, (3380), 1909 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:29,998 INFO L87 Difference]: Start difference. First operand 1912 states. Second operand has 1910 states, 1908 states have (on average 1.771488469601677) internal successors, (3380), 1909 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:30,102 INFO L93 Difference]: Finished difference Result 1912 states and 3381 transitions. [2022-02-20 19:45:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3381 transitions. [2022-02-20 19:45:30,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:30,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:30,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 1910 states, 1908 states have (on average 1.771488469601677) internal successors, (3380), 1909 states have internal predecessors, (3380), 0 states have call successors, (0), 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 1912 states. [2022-02-20 19:45:30,108 INFO L87 Difference]: Start difference. First operand has 1910 states, 1908 states have (on average 1.771488469601677) internal successors, (3380), 1909 states have internal predecessors, (3380), 0 states have call successors, (0), 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 1912 states. [2022-02-20 19:45:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:30,207 INFO L93 Difference]: Finished difference Result 1912 states and 3381 transitions. [2022-02-20 19:45:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3381 transitions. [2022-02-20 19:45:30,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:30,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:30,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:30,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1908 states have (on average 1.771488469601677) internal successors, (3380), 1909 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 3380 transitions. [2022-02-20 19:45:30,311 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 3380 transitions. Word has length 66 [2022-02-20 19:45:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:30,311 INFO L470 AbstractCegarLoop]: Abstraction has 1910 states and 3380 transitions. [2022-02-20 19:45:30,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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 19:45:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3380 transitions. [2022-02-20 19:45:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:30,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:30,312 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 19:45:30,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:45:30,312 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1100417095, now seen corresponding path program 1 times [2022-02-20 19:45:30,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:30,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800277908] [2022-02-20 19:45:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:30,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {47491#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {47491#true} is VALID [2022-02-20 19:45:30,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {47491#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {47491#true} is VALID [2022-02-20 19:45:30,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {47491#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {47491#true} is VALID [2022-02-20 19:45:30,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {47491#true} assume 0 == ~r1~0 % 256; {47491#true} is VALID [2022-02-20 19:45:30,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {47491#true} assume ~id1~0 >= 0; {47491#true} is VALID [2022-02-20 19:45:30,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {47491#true} assume 0 == ~st1~0; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {47491#true} assume ~send1~0 == ~id1~0; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {47491#true} assume 0 == ~mode1~0 % 256; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {47491#true} assume ~id2~0 >= 0; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {47491#true} assume 0 == ~st2~0; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {47491#true} assume ~send2~0 == ~id2~0; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {47491#true} assume 0 == ~mode2~0 % 256; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {47491#true} assume ~id3~0 >= 0; {47491#true} is VALID [2022-02-20 19:45:30,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {47491#true} assume 0 == ~st3~0; {47491#true} is VALID [2022-02-20 19:45:30,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {47491#true} assume ~send3~0 == ~id3~0; {47491#true} is VALID [2022-02-20 19:45:30,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {47491#true} assume 0 == ~mode3~0 % 256; {47491#true} is VALID [2022-02-20 19:45:30,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {47491#true} assume ~id4~0 >= 0; {47491#true} is VALID [2022-02-20 19:45:30,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {47491#true} assume 0 == ~st4~0; {47491#true} is VALID [2022-02-20 19:45:30,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {47491#true} assume ~send4~0 == ~id4~0; {47491#true} is VALID [2022-02-20 19:45:30,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {47491#true} assume 0 == ~mode4~0 % 256; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {47493#(= (+ (* (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;main1_~i2~0#1 := 0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {47493#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {47493#(= (+ (* (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; {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {47492#false} assume node4_~m4~0#1 != ~nomsg~0; {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {47492#false} assume !(node4_~m4~0#1 > ~id4~0); {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {47492#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {47492#false} ~mode4~0 := 0; {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {47492#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {47492#false} assume !(0 != ~mode5~0 % 256); {47492#false} is VALID [2022-02-20 19:45:30,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {47492#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {47492#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {47492#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; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {47492#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {47492#false} check_#res#1 := check_~tmp~1#1; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 63: Hoare triple {47492#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 64: Hoare triple {47492#false} assume 0 == assert_~arg#1 % 256; {47492#false} is VALID [2022-02-20 19:45:30,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {47492#false} assume !false; {47492#false} is VALID [2022-02-20 19:45:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:30,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:30,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800277908] [2022-02-20 19:45:30,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800277908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:30,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:30,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:30,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207882099] [2022-02-20 19:45:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:30,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:30,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:30,411 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 19:45:30,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:30,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:30,412 INFO L87 Difference]: Start difference. First operand 1910 states and 3380 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:32,529 INFO L93 Difference]: Finished difference Result 2598 states and 4430 transitions. [2022-02-20 19:45:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:32,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions. [2022-02-20 19:45:33,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:34,038 INFO L225 Difference]: With dead ends: 2598 [2022-02-20 19:45:34,039 INFO L226 Difference]: Without dead ends: 2230 [2022-02-20 19:45:34,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:34,040 INFO L933 BasicCegarLoop]: 1591 mSDtfsCounter, 1502 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:34,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 1686 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2022-02-20 19:45:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2228. [2022-02-20 19:45:34,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:34,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2230 states. Second operand has 2228 states, 2226 states have (on average 1.7322551662174304) internal successors, (3856), 2227 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:34,416 INFO L74 IsIncluded]: Start isIncluded. First operand 2230 states. Second operand has 2228 states, 2226 states have (on average 1.7322551662174304) internal successors, (3856), 2227 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:34,417 INFO L87 Difference]: Start difference. First operand 2230 states. Second operand has 2228 states, 2226 states have (on average 1.7322551662174304) internal successors, (3856), 2227 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:34,535 INFO L93 Difference]: Finished difference Result 2230 states and 3857 transitions. [2022-02-20 19:45:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3857 transitions. [2022-02-20 19:45:34,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:34,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:34,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 2228 states, 2226 states have (on average 1.7322551662174304) internal successors, (3856), 2227 states have internal predecessors, (3856), 0 states have call successors, (0), 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 2230 states. [2022-02-20 19:45:34,541 INFO L87 Difference]: Start difference. First operand has 2228 states, 2226 states have (on average 1.7322551662174304) internal successors, (3856), 2227 states have internal predecessors, (3856), 0 states have call successors, (0), 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 2230 states. [2022-02-20 19:45:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:34,659 INFO L93 Difference]: Finished difference Result 2230 states and 3857 transitions. [2022-02-20 19:45:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3857 transitions. [2022-02-20 19:45:34,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:34,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:34,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:34,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2226 states have (on average 1.7322551662174304) internal successors, (3856), 2227 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3856 transitions. [2022-02-20 19:45:34,790 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3856 transitions. Word has length 66 [2022-02-20 19:45:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:34,791 INFO L470 AbstractCegarLoop]: Abstraction has 2228 states and 3856 transitions. [2022-02-20 19:45:34,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3856 transitions. [2022-02-20 19:45:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:34,791 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:34,791 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 19:45:34,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:45:34,808 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:34,810 INFO L85 PathProgramCache]: Analyzing trace with hash -826729383, now seen corresponding path program 1 times [2022-02-20 19:45:34,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:34,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184033437] [2022-02-20 19:45:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:34,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:34,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {57114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {57114#true} is VALID [2022-02-20 19:45:34,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {57114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {57114#true} is VALID [2022-02-20 19:45:34,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {57114#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {57114#true} is VALID [2022-02-20 19:45:34,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {57114#true} assume 0 == ~r1~0 % 256; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {57114#true} assume ~id1~0 >= 0; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {57114#true} assume 0 == ~st1~0; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {57114#true} assume ~send1~0 == ~id1~0; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {57114#true} assume 0 == ~mode1~0 % 256; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {57114#true} assume ~id2~0 >= 0; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {57114#true} assume 0 == ~st2~0; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {57114#true} assume ~send2~0 == ~id2~0; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {57114#true} assume 0 == ~mode2~0 % 256; {57114#true} is VALID [2022-02-20 19:45:34,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {57114#true} assume ~id3~0 >= 0; {57114#true} is VALID [2022-02-20 19:45:34,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {57114#true} assume 0 == ~st3~0; {57114#true} is VALID [2022-02-20 19:45:34,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {57114#true} assume ~send3~0 == ~id3~0; {57114#true} is VALID [2022-02-20 19:45:34,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {57114#true} assume 0 == ~mode3~0 % 256; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {57116#(= (+ (* (- 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;main1_~i2~0#1 := 0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {57116#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {57116#(= (+ (* (- 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; {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {57115#false} assume node3_~m3~0#1 != ~nomsg~0; {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {57115#false} assume !(node3_~m3~0#1 > ~id3~0); {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {57115#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {57115#false} ~mode3~0 := 0; {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {57115#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {57115#false} assume !(0 != ~mode4~0 % 256); {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {57115#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {57115#false} is VALID [2022-02-20 19:45:34,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {57115#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {57115#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {57115#false} assume !(0 != ~mode5~0 % 256); {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {57115#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {57115#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {57115#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; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {57115#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {57115#false} check_#res#1 := check_~tmp~1#1; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {57115#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {57115#false} is VALID [2022-02-20 19:45:34,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {57115#false} assume 0 == assert_~arg#1 % 256; {57115#false} is VALID [2022-02-20 19:45:34,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {57115#false} assume !false; {57115#false} is VALID [2022-02-20 19:45:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:34,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:34,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184033437] [2022-02-20 19:45:34,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184033437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:34,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:34,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:34,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926836712] [2022-02-20 19:45:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:34,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:34,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:34,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:34,924 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 19:45:34,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:34,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:34,925 INFO L87 Difference]: Start difference. First operand 2228 states and 3856 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:37,521 INFO L93 Difference]: Finished difference Result 3504 states and 5778 transitions. [2022-02-20 19:45:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:37,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions. [2022-02-20 19:45:38,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:45:39,115 INFO L225 Difference]: With dead ends: 3504 [2022-02-20 19:45:39,115 INFO L226 Difference]: Without dead ends: 2818 [2022-02-20 19:45:39,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:39,117 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:45:39,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1506 Valid, 1695 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:45:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-02-20 19:45:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2816. [2022-02-20 19:45:39,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:45:39,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2818 states. Second operand has 2816 states, 2814 states have (on average 1.6773276474769012) internal successors, (4720), 2815 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:39,845 INFO L74 IsIncluded]: Start isIncluded. First operand 2818 states. Second operand has 2816 states, 2814 states have (on average 1.6773276474769012) internal successors, (4720), 2815 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:39,846 INFO L87 Difference]: Start difference. First operand 2818 states. Second operand has 2816 states, 2814 states have (on average 1.6773276474769012) internal successors, (4720), 2815 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:40,039 INFO L93 Difference]: Finished difference Result 2818 states and 4721 transitions. [2022-02-20 19:45:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4721 transitions. [2022-02-20 19:45:40,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:40,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:40,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 2816 states, 2814 states have (on average 1.6773276474769012) internal successors, (4720), 2815 states have internal predecessors, (4720), 0 states have call successors, (0), 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 2818 states. [2022-02-20 19:45:40,046 INFO L87 Difference]: Start difference. First operand has 2816 states, 2814 states have (on average 1.6773276474769012) internal successors, (4720), 2815 states have internal predecessors, (4720), 0 states have call successors, (0), 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 2818 states. [2022-02-20 19:45:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:40,231 INFO L93 Difference]: Finished difference Result 2818 states and 4721 transitions. [2022-02-20 19:45:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4721 transitions. [2022-02-20 19:45:40,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:45:40,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:45:40,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:45:40,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:45:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2814 states have (on average 1.6773276474769012) internal successors, (4720), 2815 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:45:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 4720 transitions. [2022-02-20 19:45:40,457 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 4720 transitions. Word has length 66 [2022-02-20 19:45:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:45:40,457 INFO L470 AbstractCegarLoop]: Abstraction has 2816 states and 4720 transitions. [2022-02-20 19:45:40,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 4720 transitions. [2022-02-20 19:45:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:45:40,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:45:40,458 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 19:45:40,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:45:40,458 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:45:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:45:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash 992342265, now seen corresponding path program 1 times [2022-02-20 19:45:40,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:45:40,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451310651] [2022-02-20 19:45:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:45:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:45:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:45:40,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {69717#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {69717#true} is VALID [2022-02-20 19:45:40,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {69717#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {69717#true} is VALID [2022-02-20 19:45:40,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {69717#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~ret31#1, main1_#t~ret32#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~id1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~st1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~send1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;~mode1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~id2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~st2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~send2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;~mode2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~id3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~st3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~send3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;~mode3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~id4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~st4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~send4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;~mode4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~id5~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~st5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~send5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;~mode5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {69717#true} is VALID [2022-02-20 19:45:40,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {69717#true} assume 0 == ~r1~0 % 256; {69717#true} is VALID [2022-02-20 19:45:40,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {69717#true} assume ~id1~0 >= 0; {69717#true} is VALID [2022-02-20 19:45:40,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {69717#true} assume 0 == ~st1~0; {69717#true} is VALID [2022-02-20 19:45:40,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {69717#true} assume ~send1~0 == ~id1~0; {69717#true} is VALID [2022-02-20 19:45:40,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {69717#true} assume 0 == ~mode1~0 % 256; {69717#true} is VALID [2022-02-20 19:45:40,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {69717#true} assume ~id2~0 >= 0; {69717#true} is VALID [2022-02-20 19:45:40,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {69717#true} assume 0 == ~st2~0; {69717#true} is VALID [2022-02-20 19:45:40,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {69717#true} assume ~send2~0 == ~id2~0; {69717#true} is VALID [2022-02-20 19:45:40,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {69717#true} assume 0 == ~mode2~0 % 256; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret31#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret31#1 && main1_#t~ret31#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret31#1;havoc main1_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {69719#(= (+ (* (- 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;main1_~i2~0#1 := 0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {69719#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {69719#(= (+ (* (- 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; {69718#false} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {69718#false} assume node2_~m2~0#1 != ~nomsg~0; {69718#false} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {69718#false} assume !(node2_~m2~0#1 > ~id2~0); {69718#false} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {69718#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {69718#false} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {69718#false} ~mode2~0 := 0; {69718#false} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {69718#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {69718#false} is VALID [2022-02-20 19:45:40,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {69718#false} assume !(0 != ~mode3~0 % 256); {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {69718#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {69718#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {69718#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {69718#false} assume !(0 != ~mode4~0 % 256); {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {69718#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {69718#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {69718#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {69718#false} is VALID [2022-02-20 19:45:40,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {69718#false} assume !(0 != ~mode5~0 % 256); {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {69718#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {69718#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {69718#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; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {69718#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {69718#false} check_#res#1 := check_~tmp~1#1; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {69718#false} main1_#t~ret32#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret32#1 && main1_#t~ret32#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret32#1;havoc main1_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {69718#false} assume 0 == assert_~arg#1 % 256; {69718#false} is VALID [2022-02-20 19:45:40,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {69718#false} assume !false; {69718#false} is VALID [2022-02-20 19:45:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:45:40,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:45:40,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451310651] [2022-02-20 19:45:40,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451310651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:45:40,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:45:40,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:45:40,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664090970] [2022-02-20 19:45:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:45:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:40,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:45:40,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:40,556 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 19:45:40,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:45:40,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:45:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:45:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:45:40,557 INFO L87 Difference]: Start difference. First operand 2816 states and 4720 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:45:44,232 INFO L93 Difference]: Finished difference Result 5172 states and 8210 transitions. [2022-02-20 19:45:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:45:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:45:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 19:45:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1721 transitions. [2022-02-20 19:45:44,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1721 transitions.