./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:40:11,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:40:11,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:40:11,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:40:11,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:40:11,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:40:11,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:40:11,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:40:11,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:40:11,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:40:11,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:40:11,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:40:11,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:40:11,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:40:11,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:40:11,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:40:11,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:40:11,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:40:11,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:40:11,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:40:11,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:40:11,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:40:11,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:40:11,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:40:11,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:40:11,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:40:11,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:40:11,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:40:11,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:40:11,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:40:11,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:40:11,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:40:11,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:40:11,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:40:11,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:40:11,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:40:11,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:40:11,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:40:11,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:40:11,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:40:11,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:40:11,987 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:40:12,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:40:12,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:40:12,016 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:40:12,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:40:12,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:40:12,017 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:40:12,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:40:12,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:40:12,019 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:40:12,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:40:12,020 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:40:12,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:40:12,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:40:12,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:40:12,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:40:12,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:40:12,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:40:12,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:40:12,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:40:12,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:40:12,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:40:12,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:40:12,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:40:12,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:40:12,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:12,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:40:12,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:40:12,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:40:12,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:40:12,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:40:12,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:40:12,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:40:12,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:40:12,026 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 -> 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 [2022-02-20 19:40:12,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:40:12,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:40:12,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:40:12,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:40:12,282 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:40:12,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:40:12,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4939a97/feb02ebba10e430ba7a14fb8a2f6476a/FLAGf5dcd6238 [2022-02-20 19:40:13,002 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:40:13,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:40:13,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4939a97/feb02ebba10e430ba7a14fb8a2f6476a/FLAGf5dcd6238 [2022-02-20 19:40:13,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4939a97/feb02ebba10e430ba7a14fb8a2f6476a [2022-02-20 19:40:13,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:40:13,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:40:13,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:13,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:40:13,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:40:13,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:13" (1/1) ... [2022-02-20 19:40:13,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1030c888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:13, skipping insertion in model container [2022-02-20 19:40:13,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:40:13" (1/1) ... [2022-02-20 19:40:13,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:40:13,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:40:13,626 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2022-02-20 19:40:13,687 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2022-02-20 19:40:14,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:14,493 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:40:14,533 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2022-02-20 19:40:14,550 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2022-02-20 19:40:15,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:40:15,064 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:40:15,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15 WrapperNode [2022-02-20 19:40:15,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:40:15,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:15,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:40:15,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:40:15,072 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:40:15" (1/1) ... [2022-02-20 19:40:15,127 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:40:15" (1/1) ... [2022-02-20 19:40:15,517 INFO L137 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4974 [2022-02-20 19:40:15,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:40:15,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:40:15,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:40:15,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:40:15,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:40:15,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:40:15,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:40:15,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:40:15,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (1/1) ... [2022-02-20 19:40:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:40:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:40:15,980 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:40:16,015 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:40:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:40:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:40:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:40:16,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:40:16,187 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:40:16,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:40:24,248 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:40:24,264 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:40:24,264 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:40:24,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:24 BoogieIcfgContainer [2022-02-20 19:40:24,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:40:24,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:40:24,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:40:24,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:40:24,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:40:13" (1/3) ... [2022-02-20 19:40:24,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78aef5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:24, skipping insertion in model container [2022-02-20 19:40:24,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:40:15" (2/3) ... [2022-02-20 19:40:24,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78aef5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:40:24, skipping insertion in model container [2022-02-20 19:40:24,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:40:24" (3/3) ... [2022-02-20 19:40:24,275 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:40:24,280 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:40:24,280 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:40:24,333 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:40:24,338 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:40:24,339 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:40:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:40:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:24,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:24,388 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] [2022-02-20 19:40:24,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 975463267, now seen corresponding path program 1 times [2022-02-20 19:40:24,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:24,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264860410] [2022-02-20 19:40:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:24,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {881#true} is VALID [2022-02-20 19:40:24,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {881#true} is VALID [2022-02-20 19:40:24,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:40:24,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {881#true} is VALID [2022-02-20 19:40:24,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} init_#res#1 := init_~tmp~0#1; {881#true} is VALID [2022-02-20 19:40:24,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {881#true} is VALID [2022-02-20 19:40:24,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {882#false} is VALID [2022-02-20 19:40:24,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#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;main1_~i2~0#1 := 0; {882#false} is VALID [2022-02-20 19:40:24,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:40:24,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {882#false} is VALID [2022-02-20 19:40:24,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#false} assume !(node1_~m1~0#1 != ~nomsg~0); {882#false} is VALID [2022-02-20 19:40:24,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#false} ~mode1~0 := 0; {882#false} is VALID [2022-02-20 19:40:24,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:40:24,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#false} assume !(0 != ~mode2~0 % 256); {882#false} is VALID [2022-02-20 19:40:24,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {882#false} is VALID [2022-02-20 19:40:24,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:40:24,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:40:24,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume !(0 != ~mode3~0 % 256); {882#false} is VALID [2022-02-20 19:40:24,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {882#false} is VALID [2022-02-20 19:40:24,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#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; {882#false} is VALID [2022-02-20 19:40:24,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:40:24,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {882#false} is VALID [2022-02-20 19:40:24,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {882#false} check_#res#1 := check_~tmp~1#1; {882#false} is VALID [2022-02-20 19:40:24,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {882#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {882#false} is VALID [2022-02-20 19:40:24,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {882#false} assume 0 == assert_~arg#1 % 256; {882#false} is VALID [2022-02-20 19:40:24,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:40:24,648 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:40:24,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:24,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264860410] [2022-02-20 19:40:24,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264860410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:24,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:24,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:40:24,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338385905] [2022-02-20 19:40:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:24,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:24,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:24,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:24,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:24,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:40:24,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:40:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:24,720 INFO L87 Difference]: Start difference. First operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:26,081 INFO L93 Difference]: Finished difference Result 1732 states and 3290 transitions. [2022-02-20 19:40:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:40:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3290 transitions. [2022-02-20 19:40:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3290 transitions. [2022-02-20 19:40:26,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3290 transitions. [2022-02-20 19:40:28,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3290 edges. 3290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:28,856 INFO L225 Difference]: With dead ends: 1732 [2022-02-20 19:40:28,856 INFO L226 Difference]: Without dead ends: 812 [2022-02-20 19:40:28,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:40:28,870 INFO L933 BasicCegarLoop]: 1597 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:28,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-02-20 19:40:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-02-20 19:40:28,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:28,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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:40:28,961 INFO L74 IsIncluded]: Start isIncluded. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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:40:28,963 INFO L87 Difference]: Start difference. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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:40:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:29,004 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:40:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:40:29,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:29,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:29,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 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 812 states. [2022-02-20 19:40:29,018 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 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 812 states. [2022-02-20 19:40:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:29,057 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions. [2022-02-20 19:40:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:40:29,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:29,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:29,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:29,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8925925925925926) internal successors, (1533), 811 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have 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:40:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1533 transitions. [2022-02-20 19:40:29,108 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1533 transitions. Word has length 26 [2022-02-20 19:40:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:29,109 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1533 transitions. [2022-02-20 19:40:29,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions. [2022-02-20 19:40:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:40:29,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:29,116 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] [2022-02-20 19:40:29,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:40:29,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:40:29,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:29,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436597492] [2022-02-20 19:40:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:29,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {5091#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {5091#true} is VALID [2022-02-20 19:40:29,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {5091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {5091#true} is VALID [2022-02-20 19:40:29,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {5091#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5091#true} is VALID [2022-02-20 19:40:29,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {5091#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5093#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:40:29,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {5093#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5094#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:40:29,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {5094#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {5095#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:40:29,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {5095#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5092#false} is VALID [2022-02-20 19:40:29,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {5092#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;main1_~i2~0#1 := 0; {5092#false} is VALID [2022-02-20 19:40:29,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:29,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {5092#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5092#false} is VALID [2022-02-20 19:40:29,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {5092#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5092#false} is VALID [2022-02-20 19:40:29,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {5092#false} ~mode1~0 := 0; {5092#false} is VALID [2022-02-20 19:40:29,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:29,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {5092#false} assume !(0 != ~mode2~0 % 256); {5092#false} is VALID [2022-02-20 19:40:29,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {5092#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5092#false} is VALID [2022-02-20 19:40:29,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:29,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:29,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {5092#false} assume !(0 != ~mode3~0 % 256); {5092#false} is VALID [2022-02-20 19:40:29,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {5092#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5092#false} is VALID [2022-02-20 19:40:29,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {5092#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; {5092#false} is VALID [2022-02-20 19:40:29,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {5092#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5092#false} is VALID [2022-02-20 19:40:29,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {5092#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5092#false} is VALID [2022-02-20 19:40:29,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {5092#false} check_#res#1 := check_~tmp~1#1; {5092#false} is VALID [2022-02-20 19:40:29,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {5092#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {5092#false} is VALID [2022-02-20 19:40:29,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {5092#false} assume 0 == assert_~arg#1 % 256; {5092#false} is VALID [2022-02-20 19:40:29,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {5092#false} assume !false; {5092#false} is VALID [2022-02-20 19:40:29,250 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:40:29,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:29,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436597492] [2022-02-20 19:40:29,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436597492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:29,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:29,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:29,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288871719] [2022-02-20 19:40:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:29,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:29,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:29,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:29,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:29,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:29,284 INFO L87 Difference]: Start difference. First operand 812 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:33,647 INFO L93 Difference]: Finished difference Result 852 states and 1593 transitions. [2022-02-20 19:40:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:40:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-02-20 19:40:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-02-20 19:40:33,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1593 transitions. [2022-02-20 19:40:34,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1593 edges. 1593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:34,937 INFO L225 Difference]: With dead ends: 852 [2022-02-20 19:40:34,937 INFO L226 Difference]: Without dead ends: 812 [2022-02-20 19:40:34,938 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:40:34,939 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 3 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:34,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-02-20 19:40:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-02-20 19:40:34,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:34,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:40:34,960 INFO L74 IsIncluded]: Start isIncluded. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:40:34,962 INFO L87 Difference]: Start difference. First operand 812 states. Second operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:40:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:34,997 INFO L93 Difference]: Finished difference Result 812 states and 1517 transitions. [2022-02-20 19:40:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:40:34,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:34,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:35,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 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 812 states. [2022-02-20 19:40:35,003 INFO L87 Difference]: Start difference. First operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 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 812 states. [2022-02-20 19:40:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:35,039 INFO L93 Difference]: Finished difference Result 812 states and 1517 transitions. [2022-02-20 19:40:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:40:35,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:35,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:35,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:35,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 1.8728395061728396) internal successors, (1517), 811 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have 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:40:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1517 transitions. [2022-02-20 19:40:35,080 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1517 transitions. Word has length 26 [2022-02-20 19:40:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:35,081 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1517 transitions. [2022-02-20 19:40:35,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:40:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions. [2022-02-20 19:40:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:35,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:35,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:35,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:40:35,083 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:40:35,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:35,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455224615] [2022-02-20 19:40:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:35,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {8421#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {8421#true} is VALID [2022-02-20 19:40:35,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {8421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8421#true} is VALID [2022-02-20 19:40:35,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {8421#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8421#true} is VALID [2022-02-20 19:40:35,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {8421#true} assume 0 == ~r1~0 % 256; {8421#true} is VALID [2022-02-20 19:40:35,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {8421#true} assume ~id1~0 >= 0; {8421#true} is VALID [2022-02-20 19:40:35,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {8421#true} assume 0 == ~st1~0; {8421#true} is VALID [2022-02-20 19:40:35,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {8421#true} assume ~send1~0 == ~id1~0; {8421#true} is VALID [2022-02-20 19:40:35,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {8421#true} assume 0 == ~mode1~0 % 256; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:40:35,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {8423#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8422#false} is VALID [2022-02-20 19:40:35,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {8422#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8422#false} is VALID [2022-02-20 19:40:35,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {8422#false} ~mode1~0 := 0; {8422#false} is VALID [2022-02-20 19:40:35,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:35,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {8422#false} assume !(0 != ~mode2~0 % 256); {8422#false} is VALID [2022-02-20 19:40:35,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {8422#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8422#false} is VALID [2022-02-20 19:40:35,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:35,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:35,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {8422#false} assume !(0 != ~mode3~0 % 256); {8422#false} is VALID [2022-02-20 19:40:35,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {8422#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8422#false} is VALID [2022-02-20 19:40:35,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {8422#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; {8422#false} is VALID [2022-02-20 19:40:35,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {8422#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8422#false} is VALID [2022-02-20 19:40:35,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {8422#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8422#false} is VALID [2022-02-20 19:40:35,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {8422#false} check_#res#1 := check_~tmp~1#1; {8422#false} is VALID [2022-02-20 19:40:35,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {8422#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {8422#false} is VALID [2022-02-20 19:40:35,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {8422#false} assume 0 == assert_~arg#1 % 256; {8422#false} is VALID [2022-02-20 19:40:35,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {8422#false} assume !false; {8422#false} is VALID [2022-02-20 19:40:35,223 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:40:35,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:35,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455224615] [2022-02-20 19:40:35,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455224615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:35,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:35,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:35,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224213822] [2022-02-20 19:40:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:35,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:35,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:35,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:35,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:35,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:35,258 INFO L87 Difference]: Start difference. First operand 812 states and 1517 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:37,056 INFO L93 Difference]: Finished difference Result 878 states and 1619 transitions. [2022-02-20 19:40:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:37,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:37,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:40:38,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:38,621 INFO L225 Difference]: With dead ends: 878 [2022-02-20 19:40:38,622 INFO L226 Difference]: Without dead ends: 842 [2022-02-20 19:40:38,622 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:40:38,623 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1485 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1613 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:40:38,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1613 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-02-20 19:40:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 840. [2022-02-20 19:40:38,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:38,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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:40:38,641 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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:40:38,643 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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:40:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:38,682 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions. [2022-02-20 19:40:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions. [2022-02-20 19:40:38,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:38,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:38,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 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 842 states. [2022-02-20 19:40:38,687 INFO L87 Difference]: Start difference. First operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 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 842 states. [2022-02-20 19:40:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:38,725 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions. [2022-02-20 19:40:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions. [2022-02-20 19:40:38,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:38,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:38,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:38,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.8627684964200477) internal successors, (1561), 839 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have 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:40:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1561 transitions. [2022-02-20 19:40:38,768 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1561 transitions. Word has length 41 [2022-02-20 19:40:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:38,768 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1561 transitions. [2022-02-20 19:40:38,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1561 transitions. [2022-02-20 19:40:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:40:38,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:38,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:40:38,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:40:38,772 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:40:38,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:38,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892241158] [2022-02-20 19:40:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:38,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {11870#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {11870#true} is VALID [2022-02-20 19:40:38,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {11870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {11870#true} is VALID [2022-02-20 19:40:38,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {11870#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {11870#true} is VALID [2022-02-20 19:40:38,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {11870#true} assume 0 == ~r1~0 % 256; {11870#true} is VALID [2022-02-20 19:40:38,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {11870#true} assume ~id1~0 >= 0; {11870#true} is VALID [2022-02-20 19:40:38,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {11870#true} assume 0 == ~st1~0; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:38,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {11872#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:38,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {11872#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:38,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {11872#(<= ~st1~0 0)} assume ~id2~0 >= 0; {11872#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:38,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {11872#(<= ~st1~0 0)} assume 0 == ~st2~0; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {11873#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {11873#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {11874#(<= (+ ~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;main1_~i2~0#1 := 0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {11874#(<= (+ ~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; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:38,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {11874#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {11871#false} is VALID [2022-02-20 19:40:38,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {11871#false} check_#res#1 := check_~tmp~1#1; {11871#false} is VALID [2022-02-20 19:40:38,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {11871#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {11871#false} is VALID [2022-02-20 19:40:38,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {11871#false} assume 0 == assert_~arg#1 % 256; {11871#false} is VALID [2022-02-20 19:40:38,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {11871#false} assume !false; {11871#false} is VALID [2022-02-20 19:40:38,924 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:40:38,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:38,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892241158] [2022-02-20 19:40:38,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892241158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:38,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:38,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:38,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476168207] [2022-02-20 19:40:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:38,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:38,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:38,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:38,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:38,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:38,955 INFO L87 Difference]: Start difference. First operand 840 states and 1561 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:41,473 INFO L93 Difference]: Finished difference Result 1224 states and 2161 transitions. [2022-02-20 19:40:41,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:40:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 19:40:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:40:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:40:41,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:40:43,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:43,115 INFO L225 Difference]: With dead ends: 1224 [2022-02-20 19:40:43,115 INFO L226 Difference]: Without dead ends: 1160 [2022-02-20 19:40:43,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:43,116 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 4709 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:43,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4709 Valid, 1779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-02-20 19:40:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 902. [2022-02-20 19:40:43,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:43,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:40:43,168 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:40:43,170 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:40:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,236 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions. [2022-02-20 19:40:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions. [2022-02-20 19:40:43,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:43,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:43,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 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 1160 states. [2022-02-20 19:40:43,250 INFO L87 Difference]: Start difference. First operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 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 1160 states. [2022-02-20 19:40:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:43,319 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions. [2022-02-20 19:40:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions. [2022-02-20 19:40:43,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:43,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:43,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:43,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 900 states have (on average 1.84) internal successors, (1656), 901 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:40:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1656 transitions. [2022-02-20 19:40:43,373 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1656 transitions. Word has length 41 [2022-02-20 19:40:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:43,374 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1656 transitions. [2022-02-20 19:40:43,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:40:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1656 transitions. [2022-02-20 19:40:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:43,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:43,375 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] [2022-02-20 19:40:43,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:40:43,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:40:43,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:43,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430781810] [2022-02-20 19:40:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:43,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {16450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {16450#true} is VALID [2022-02-20 19:40:43,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {16450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {16450#true} is VALID [2022-02-20 19:40:43,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {16450#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16450#true} is VALID [2022-02-20 19:40:43,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {16450#true} assume 0 == ~r1~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {16452#(<= ~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;main1_~i2~0#1 := 0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {16452#(<= ~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; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 19:40:43,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {16452#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 3; {16451#false} is VALID [2022-02-20 19:40:43,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {16451#false} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {16451#false} is VALID [2022-02-20 19:40:43,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {16451#false} check_#res#1 := check_~tmp~1#1; {16451#false} is VALID [2022-02-20 19:40:43,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {16451#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {16451#false} is VALID [2022-02-20 19:40:43,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {16451#false} assume 0 == assert_~arg#1 % 256; {16451#false} is VALID [2022-02-20 19:40:43,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {16451#false} assume !false; {16451#false} is VALID [2022-02-20 19:40:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:40:43,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:43,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430781810] [2022-02-20 19:40:43,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430781810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:43,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:43,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:43,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026238833] [2022-02-20 19:40:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:43,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:43,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:43,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:43,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:43,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:43,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:43,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:43,507 INFO L87 Difference]: Start difference. First operand 902 states and 1656 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:44,888 INFO L93 Difference]: Finished difference Result 1089 states and 1943 transitions. [2022-02-20 19:40:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:40:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:40:44,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:40:46,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1620 edges. 1620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:46,339 INFO L225 Difference]: With dead ends: 1089 [2022-02-20 19:40:46,339 INFO L226 Difference]: Without dead ends: 963 [2022-02-20 19:40:46,340 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:40:46,340 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 1469 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:46,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-02-20 19:40:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2022-02-20 19:40:46,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:46,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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:40:46,414 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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:40:46,415 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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:40:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:46,459 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions. [2022-02-20 19:40:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions. [2022-02-20 19:40:46,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:46,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:46,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:46,464 INFO L87 Difference]: Start difference. First operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:46,509 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions. [2022-02-20 19:40:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions. [2022-02-20 19:40:46,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:46,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:46,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:46,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 959 states have (on average 1.8185610010427529) internal successors, (1744), 960 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have 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:40:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1744 transitions. [2022-02-20 19:40:46,567 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1744 transitions. Word has length 43 [2022-02-20 19:40:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:46,568 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1744 transitions. [2022-02-20 19:40:46,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1744 transitions. [2022-02-20 19:40:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:46,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:46,569 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] [2022-02-20 19:40:46,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:40:46,569 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:40:46,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:46,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019890477] [2022-02-20 19:40:46,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:46,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {20539#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {20539#true} is VALID [2022-02-20 19:40:46,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {20539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {20539#true} is VALID [2022-02-20 19:40:46,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {20539#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {20539#true} is VALID [2022-02-20 19:40:46,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {20539#true} assume 0 == ~r1~0 % 256; {20539#true} is VALID [2022-02-20 19:40:46,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {20539#true} assume ~id1~0 >= 0; {20539#true} is VALID [2022-02-20 19:40:46,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {20539#true} assume 0 == ~st1~0; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:46,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:46,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:46,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:40:46,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {20541#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:46,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:46,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:46,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:40:46,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {20542#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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;main1_~i2~0#1 := 0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 3); {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:46,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {20543#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {20540#false} is VALID [2022-02-20 19:40:46,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {20540#false} check_#res#1 := check_~tmp~1#1; {20540#false} is VALID [2022-02-20 19:40:46,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {20540#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {20540#false} is VALID [2022-02-20 19:40:46,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {20540#false} assume 0 == assert_~arg#1 % 256; {20540#false} is VALID [2022-02-20 19:40:46,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {20540#false} assume !false; {20540#false} is VALID [2022-02-20 19:40:46,749 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:40:46,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:46,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019890477] [2022-02-20 19:40:46,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019890477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:46,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:46,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:46,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441379359] [2022-02-20 19:40:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:46,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:46,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:46,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:46,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:46,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:46,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:46,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:46,788 INFO L87 Difference]: Start difference. First operand 961 states and 1744 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:49,900 INFO L93 Difference]: Finished difference Result 1146 states and 2026 transitions. [2022-02-20 19:40:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:49,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:40:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:40:49,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:40:51,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1627 edges. 1627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:51,357 INFO L225 Difference]: With dead ends: 1146 [2022-02-20 19:40:51,357 INFO L226 Difference]: Without dead ends: 963 [2022-02-20 19:40:51,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:40:51,358 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 4476 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:51,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4476 Valid, 1633 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-02-20 19:40:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2022-02-20 19:40:51,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:51,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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:40:51,440 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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:40:51,441 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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:40:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:51,484 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions. [2022-02-20 19:40:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions. [2022-02-20 19:40:51,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:51,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:51,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:51,489 INFO L87 Difference]: Start difference. First operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 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 963 states. [2022-02-20 19:40:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:51,528 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions. [2022-02-20 19:40:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions. [2022-02-20 19:40:51,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:51,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:51,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:51,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 959 states have (on average 1.8154327424400416) internal successors, (1741), 960 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have 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:40:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1741 transitions. [2022-02-20 19:40:51,572 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1741 transitions. Word has length 43 [2022-02-20 19:40:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:51,572 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1741 transitions. [2022-02-20 19:40:51,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1741 transitions. [2022-02-20 19:40:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:51,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:51,573 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] [2022-02-20 19:40:51,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:40:51,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:40:51,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:51,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510407428] [2022-02-20 19:40:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:51,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {24700#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {24700#true} is VALID [2022-02-20 19:40:51,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {24700#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {24700#true} is VALID [2022-02-20 19:40:51,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {24700#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {24700#true} is VALID [2022-02-20 19:40:51,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {24700#true} assume 0 == ~r1~0 % 256; {24700#true} is VALID [2022-02-20 19:40:51,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {24700#true} assume ~id1~0 >= 0; {24700#true} is VALID [2022-02-20 19:40:51,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {24700#true} assume 0 == ~st1~0; {24700#true} is VALID [2022-02-20 19:40:51,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {24700#true} assume ~send1~0 == ~id1~0; {24700#true} is VALID [2022-02-20 19:40:51,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {24700#true} assume 0 == ~mode1~0 % 256; {24700#true} is VALID [2022-02-20 19:40:51,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {24700#true} assume ~id2~0 >= 0; {24700#true} is VALID [2022-02-20 19:40:51,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {24700#true} assume 0 == ~st2~0; {24700#true} is VALID [2022-02-20 19:40:51,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {24700#true} assume ~send2~0 == ~id2~0; {24700#true} is VALID [2022-02-20 19:40:51,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {24700#true} assume 0 == ~mode2~0 % 256; {24700#true} is VALID [2022-02-20 19:40:51,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {24700#true} assume ~id3~0 >= 0; {24700#true} is VALID [2022-02-20 19:40:51,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {24700#true} assume 0 == ~st3~0; {24700#true} is VALID [2022-02-20 19:40:51,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {24700#true} assume ~send3~0 == ~id3~0; {24700#true} is VALID [2022-02-20 19:40:51,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {24700#true} assume 0 == ~mode3~0 % 256; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {24702#(= (+ (* (- 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;main1_~i2~0#1 := 0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {24702#(= (+ (* (- 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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {24702#(= (+ (* (- 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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {24702#(= (+ (* (- 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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {24702#(= (+ (* (- 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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {24702#(= (+ (* (- 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; {24702#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:40:51,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {24702#(= (+ (* (- 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; {24701#false} is VALID [2022-02-20 19:40:51,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {24701#false} assume node3_~m3~0#1 != ~nomsg~0; {24701#false} is VALID [2022-02-20 19:40:51,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {24701#false} assume !(node3_~m3~0#1 > ~id3~0); {24701#false} is VALID [2022-02-20 19:40:51,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {24701#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {24701#false} is VALID [2022-02-20 19:40:51,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {24701#false} ~mode3~0 := 0; {24701#false} is VALID [2022-02-20 19:40:51,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {24701#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {24701#false} is VALID [2022-02-20 19:40:51,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {24701#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {24701#false} is VALID [2022-02-20 19:40:51,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {24701#false} check_#res#1 := check_~tmp~1#1; {24701#false} is VALID [2022-02-20 19:40:51,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {24701#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {24701#false} is VALID [2022-02-20 19:40:51,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {24701#false} assume 0 == assert_~arg#1 % 256; {24701#false} is VALID [2022-02-20 19:40:51,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {24701#false} assume !false; {24701#false} is VALID [2022-02-20 19:40:51,651 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:40:51,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:51,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510407428] [2022-02-20 19:40:51,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510407428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:51,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:51,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:51,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482144409] [2022-02-20 19:40:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:51,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:51,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:51,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:51,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:51,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:51,688 INFO L87 Difference]: Start difference. First operand 961 states and 1741 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:53,422 INFO L93 Difference]: Finished difference Result 1291 states and 2237 transitions. [2022-02-20 19:40:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:53,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:53,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:40:54,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:54,857 INFO L225 Difference]: With dead ends: 1291 [2022-02-20 19:40:54,857 INFO L226 Difference]: Without dead ends: 1108 [2022-02-20 19:40:54,857 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:40:54,858 INFO L933 BasicCegarLoop]: 1541 mSDtfsCounter, 1477 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1603 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:40:54,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1603 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-02-20 19:40:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2022-02-20 19:40:54,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:54,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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:40:54,984 INFO L74 IsIncluded]: Start isIncluded. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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:40:54,985 INFO L87 Difference]: Start difference. First operand 1108 states. Second operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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:40:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:55,039 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions. [2022-02-20 19:40:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions. [2022-02-20 19:40:55,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:55,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:55,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 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 1108 states. [2022-02-20 19:40:55,045 INFO L87 Difference]: Start difference. First operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 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 1108 states. [2022-02-20 19:40:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:55,101 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions. [2022-02-20 19:40:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions. [2022-02-20 19:40:55,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:55,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:55,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:55,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1104 states have (on average 1.7681159420289856) internal successors, (1952), 1105 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have 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:40:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1952 transitions. [2022-02-20 19:40:55,163 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1952 transitions. Word has length 43 [2022-02-20 19:40:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:55,164 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1952 transitions. [2022-02-20 19:40:55,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1952 transitions. [2022-02-20 19:40:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:40:55,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:55,165 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] [2022-02-20 19:40:55,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:40:55,165 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:40:55,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:55,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66106717] [2022-02-20 19:40:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:55,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {29507#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {29507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {29507#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {29507#true} assume 0 == ~r1~0 % 256; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {29507#true} assume ~id1~0 >= 0; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {29507#true} assume 0 == ~st1~0; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {29507#true} assume ~send1~0 == ~id1~0; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {29507#true} assume 0 == ~mode1~0 % 256; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {29507#true} assume ~id2~0 >= 0; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {29507#true} assume 0 == ~st2~0; {29507#true} is VALID [2022-02-20 19:40:55,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {29507#true} assume ~send2~0 == ~id2~0; {29507#true} is VALID [2022-02-20 19:40:55,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {29507#true} assume 0 == ~mode2~0 % 256; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {29509#(= (+ (* (- 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;main1_~i2~0#1 := 0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {29509#(= (+ (* (- 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; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {29509#(= (+ (* (- 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; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {29509#(= (+ (* (- 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; {29509#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {29509#(= (+ (* (- 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; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {29508#false} assume node2_~m2~0#1 != ~nomsg~0; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {29508#false} assume !(node2_~m2~0#1 > ~id2~0); {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {29508#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {29508#false} ~mode2~0 := 0; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {29508#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; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {29508#false} assume !(0 != ~mode3~0 % 256); {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {29508#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {29508#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; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {29508#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29508#false} is VALID [2022-02-20 19:40:55,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {29508#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {29508#false} is VALID [2022-02-20 19:40:55,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {29508#false} check_#res#1 := check_~tmp~1#1; {29508#false} is VALID [2022-02-20 19:40:55,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {29508#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {29508#false} is VALID [2022-02-20 19:40:55,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {29508#false} assume 0 == assert_~arg#1 % 256; {29508#false} is VALID [2022-02-20 19:40:55,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {29508#false} assume !false; {29508#false} is VALID [2022-02-20 19:40:55,215 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:40:55,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:55,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66106717] [2022-02-20 19:40:55,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66106717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:55,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:55,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:40:55,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428928850] [2022-02-20 19:40:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:55,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:55,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:55,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:55,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:40:55,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:55,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:40:55,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:40:55,246 INFO L87 Difference]: Start difference. First operand 1106 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:57,163 INFO L93 Difference]: Finished difference Result 1690 states and 2810 transitions. [2022-02-20 19:40:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:40:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:40:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:40:57,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:40:58,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:58,582 INFO L225 Difference]: With dead ends: 1690 [2022-02-20 19:40:58,582 INFO L226 Difference]: Without dead ends: 1362 [2022-02-20 19:40:58,582 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:40:58,583 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 1481 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1612 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:40:58,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 1612 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-02-20 19:40:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1360. [2022-02-20 19:40:58,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:58,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:40:58,845 INFO L74 IsIncluded]: Start isIncluded. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:40:58,846 INFO L87 Difference]: Start difference. First operand 1362 states. Second operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:40:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:58,924 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions. [2022-02-20 19:40:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions. [2022-02-20 19:40:58,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:58,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:58,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 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 1362 states. [2022-02-20 19:40:58,930 INFO L87 Difference]: Start difference. First operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 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 1362 states. [2022-02-20 19:40:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:59,009 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions. [2022-02-20 19:40:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions. [2022-02-20 19:40:59,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:59,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:59,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:59,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1358 states have (on average 1.6995581737849779) internal successors, (2308), 1359 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have 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:40:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2308 transitions. [2022-02-20 19:40:59,088 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2308 transitions. Word has length 43 [2022-02-20 19:40:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:59,089 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 2308 transitions. [2022-02-20 19:40:59,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:40:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2308 transitions. [2022-02-20 19:40:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:40:59,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:59,089 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] [2022-02-20 19:40:59,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:40:59,090 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:59,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times [2022-02-20 19:40:59,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:59,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773898733] [2022-02-20 19:40:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:59,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {35650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {35650#true} is VALID [2022-02-20 19:40:59,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {35650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {35650#true} is VALID [2022-02-20 19:40:59,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {35650#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, 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~ret21#1, main1_#t~ret22#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~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35650#true} is VALID [2022-02-20 19:40:59,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {35650#true} assume 0 == ~r1~0 % 256; {35650#true} is VALID [2022-02-20 19:40:59,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {35650#true} assume ~id1~0 >= 0; {35650#true} is VALID [2022-02-20 19:40:59,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {35650#true} assume 0 == ~st1~0; {35650#true} is VALID [2022-02-20 19:40:59,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {35650#true} assume ~send1~0 == ~id1~0; {35650#true} is VALID [2022-02-20 19:40:59,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {35650#true} assume 0 == ~mode1~0 % 256; {35650#true} is VALID [2022-02-20 19:40:59,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {35650#true} assume ~id2~0 >= 0; {35650#true} is VALID [2022-02-20 19:40:59,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {35650#true} assume 0 == ~st2~0; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {35650#true} assume ~send2~0 == ~id2~0; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {35650#true} assume 0 == ~mode2~0 % 256; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {35650#true} assume ~id3~0 >= 0; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {35650#true} assume 0 == ~st3~0; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {35650#true} assume ~send3~0 == ~id3~0; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {35650#true} assume 0 == ~mode3~0 % 256; {35650#true} is VALID [2022-02-20 19:40:59,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {35650#true} assume ~id1~0 != ~id2~0; {35650#true} is VALID [2022-02-20 19:40:59,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {35650#true} assume ~id1~0 != ~id3~0; {35650#true} is VALID [2022-02-20 19:40:59,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {35650#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {35652#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:40:59,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {35652#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {35653#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:40:59,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {35653#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#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; {35654#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 19:40:59,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {35654#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {35650#true} is VALID [2022-02-20 19:40:59,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {35650#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {35650#true} is VALID [2022-02-20 19:40:59,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {35650#true} 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; {35650#true} is VALID [2022-02-20 19:40:59,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {35650#true} assume !(0 != ~mode1~0 % 256); {35650#true} is VALID [2022-02-20 19:40:59,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {35650#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35650#true} is VALID [2022-02-20 19:40:59,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {35650#true} ~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; {35650#true} is VALID [2022-02-20 19:40:59,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {35650#true} 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; {35650#true} is VALID [2022-02-20 19:40:59,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {35650#true} assume !(0 != ~mode2~0 % 256); {35650#true} is VALID [2022-02-20 19:40:59,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {35650#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35650#true} is VALID [2022-02-20 19:40:59,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {35650#true} ~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; {35650#true} is VALID [2022-02-20 19:40:59,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {35650#true} 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; {35650#true} is VALID [2022-02-20 19:40:59,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {35650#true} assume !(0 != ~mode3~0 % 256); {35650#true} is VALID [2022-02-20 19:40:59,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {35650#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {35650#true} is VALID [2022-02-20 19:40:59,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {35650#true} ~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; {35650#true} is VALID [2022-02-20 19:40:59,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {35650#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {35650#true} is VALID [2022-02-20 19:40:59,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {35650#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35650#true} is VALID [2022-02-20 19:40:59,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {35650#true} assume !(~r1~0 % 256 >= 3); {35650#true} is VALID [2022-02-20 19:40:59,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {35650#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {35650#true} is VALID [2022-02-20 19:40:59,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {35650#true} assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; {35655#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:40:59,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {35655#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {35656#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:40:59,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {35656#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {35657#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:40:59,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {35657#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {35651#false} is VALID [2022-02-20 19:40:59,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {35651#false} assume !false; {35651#false} is VALID [2022-02-20 19:40:59,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:40:59,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:59,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773898733] [2022-02-20 19:40:59,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773898733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:59,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:59,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:40:59,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510922338] [2022-02-20 19:40:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:40:59,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:59,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:59,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:59,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:40:59,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:59,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:40:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:40:59,222 INFO L87 Difference]: Start difference. First operand 1360 states and 2308 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:41:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:06,293 INFO L93 Difference]: Finished difference Result 1883 states and 3036 transitions. [2022-02-20 19:41:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:41:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:41:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:41:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:41:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:41:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:41:06,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1577 transitions. [2022-02-20 19:41:07,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1577 edges. 1577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:07,572 INFO L225 Difference]: With dead ends: 1883 [2022-02-20 19:41:07,572 INFO L226 Difference]: Without dead ends: 1881 [2022-02-20 19:41:07,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:41:07,573 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 424 mSDsluCounter, 8903 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 10434 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:07,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 10434 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-02-20 19:41:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1408. [2022-02-20 19:41:07,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:07,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:41:07,952 INFO L74 IsIncluded]: Start isIncluded. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:41:07,954 INFO L87 Difference]: Start difference. First operand 1881 states. Second operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have 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:41:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:08,109 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions. [2022-02-20 19:41:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions. [2022-02-20 19:41:08,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:08,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:08,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 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 1881 states. [2022-02-20 19:41:08,116 INFO L87 Difference]: Start difference. First operand has 1408 states, 1406 states have (on average 1.6728307254623045) internal successors, (2352), 1407 states have internal predecessors, (2352), 0 states have call successors, (0), 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 1881 states.