./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.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.ufo.BOUNDED-6.pals+Problem12_label02.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 d7b7824f74ab8cbbea36fdaee1d1dc5c7e52c10bcc21a0858c24d31348bf95ad
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-20 19:38:43,396 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-20 19:38:43,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-20 19:38:43,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-20 19:38:43,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-20 19:38:43,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-20 19:38:43,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-20 19:38:43,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-20 19:38:43,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-20 19:38:43,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-20 19:38:43,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-20 19:38:43,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-20 19:38:43,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-20 19:38:43,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-20 19:38:43,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-20 19:38:43,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-20 19:38:43,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-20 19:38:43,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-20 19:38:43,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-20 19:38:43,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-20 19:38:43,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-20 19:38:43,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-20 19:38:43,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-20 19:38:43,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-20 19:38:43,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-20 19:38:43,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-20 19:38:43,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-20 19:38:43,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-20 19:38:43,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-20 19:38:43,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-20 19:38:43,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-20 19:38:43,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-20 19:38:43,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-20 19:38:43,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-20 19:38:43,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-20 19:38:43,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-20 19:38:43,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-20 19:38:43,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-20 19:38:43,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-20 19:38:43,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-20 19:38:43,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-20 19:38:43,499 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:38:43,531 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-20 19:38:43,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-20 19:38:43,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-20 19:38:43,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-20 19:38:43,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-20 19:38:43,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-20 19:38:43,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-20 19:38:43,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-20 19:38:43,535 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-20 19:38:43,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-20 19:38:43,536 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-20 19:38:43,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-20 19:38:43,536 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-20 19:38:43,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-20 19:38:43,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-20 19:38:43,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-20 19:38:43,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-20 19:38:43,537 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-20 19:38:43,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-20 19:38:43,538 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-20 19:38:43,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-20 19:38:43,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-20 19:38:43,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-20 19:38:43,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-20 19:38:43,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 19:38:43,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-20 19:38:43,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-20 19:38:43,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-20 19:38:43,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-20 19:38:43,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-20 19:38:43,541 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-20 19:38:43,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-02-20 19:38:43,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-20 19:38:43,542 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 -> d7b7824f74ab8cbbea36fdaee1d1dc5c7e52c10bcc21a0858c24d31348bf95ad
[2022-02-20 19:38:43,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-20 19:38:43,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-20 19:38:43,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-20 19:38:43,812 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-20 19:38:43,815 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-20 19:38:43,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.c
[2022-02-20 19:38:43,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05834bca0/38c63b7d417a4605ba822c6843a70054/FLAGbcb734433
[2022-02-20 19:38:44,464 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-20 19:38:44,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.c
[2022-02-20 19:38:44,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05834bca0/38c63b7d417a4605ba822c6843a70054/FLAGbcb734433
[2022-02-20 19:38:44,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05834bca0/38c63b7d417a4605ba822c6843a70054
[2022-02-20 19:38:44,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-20 19:38:44,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-20 19:38:44,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-20 19:38:44,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-20 19:38:44,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-20 19:38:44,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:38:44" (1/1) ...
[2022-02-20 19:38:44,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157cf6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:44, skipping insertion in model container
[2022-02-20 19:38:44,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:38:44" (1/1) ...
[2022-02-20 19:38:44,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-20 19:38:44,776 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-20 19:38:45,046 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.ufo.BOUNDED-6.pals+Problem12_label02.c[6354,6367]
[2022-02-20 19:38:45,113 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.ufo.BOUNDED-6.pals+Problem12_label02.c[13644,13657]
[2022-02-20 19:38:45,840 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 19:38:45,849 INFO L203 MainTranslator]: Completed pre-run
[2022-02-20 19:38:45,886 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.ufo.BOUNDED-6.pals+Problem12_label02.c[6354,6367]
[2022-02-20 19:38:45,901 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.ufo.BOUNDED-6.pals+Problem12_label02.c[13644,13657]
[2022-02-20 19:38:46,332 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 19:38:46,356 INFO L208 MainTranslator]: Completed translation
[2022-02-20 19:38:46,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46 WrapperNode
[2022-02-20 19:38:46,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-20 19:38:46,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-20 19:38:46,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-20 19:38:46,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-20 19:38:46,364 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:38:46" (1/1) ...
[2022-02-20 19:38:46,412 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:38:46" (1/1) ...
[2022-02-20 19:38:46,800 INFO L137 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4976
[2022-02-20 19:38:46,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-20 19:38:46,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-20 19:38:46,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-20 19:38:46,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-20 19:38:46,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:46,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:46,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:46,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:47,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:47,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:47,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:47,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-20 19:38:47,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-20 19:38:47,289 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-20 19:38:47,289 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-20 19:38:47,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (1/1) ...
[2022-02-20 19:38:47,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 19:38:47,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 19:38:47,324 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:38:47,340 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:38:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-20 19:38:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-20 19:38:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-20 19:38:47,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-20 19:38:47,454 INFO L234 CfgBuilder]: Building ICFG
[2022-02-20 19:38:47,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-20 19:38:55,749 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-20 19:38:55,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-20 19:38:55,768 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-02-20 19:38:55,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:38:55 BoogieIcfgContainer
[2022-02-20 19:38:55,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-20 19:38:55,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-20 19:38:55,773 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-20 19:38:55,776 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-20 19:38:55,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:38:44" (1/3) ...
[2022-02-20 19:38:55,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24117d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:38:55, skipping insertion in model container
[2022-02-20 19:38:55,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:38:46" (2/3) ...
[2022-02-20 19:38:55,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24117d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:38:55, skipping insertion in model container
[2022-02-20 19:38:55,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:38:55" (3/3) ...
[2022-02-20 19:38:55,779 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label02.c
[2022-02-20 19:38:55,783 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-20 19:38:55,783 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-20 19:38:55,827 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-20 19:38:55,832 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:38:55,833 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2022-02-20 19:38:55,873 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:38:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-02-20 19:38:55,880 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:38:55,880 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:38:55,881 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:38:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:38:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash 975463267, now seen corresponding path program 1 times
[2022-02-20 19:38:55,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:38:55,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532873173]
[2022-02-20 19:38:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:38:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:38:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:38:56,091 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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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:38:56,092 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~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {881#true} is VALID
[2022-02-20 19:38:56,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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:38:56,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {881#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {881#true} is VALID
[2022-02-20 19:38:56,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {881#true} init_#res#1 := init_~tmp~0#1; {881#true} is VALID
[2022-02-20 19:38:56,093 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; {881#true} is VALID
[2022-02-20 19:38:56,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume 0 == main1_~i2~0#1;assume false; {882#false} is VALID
[2022-02-20 19:38:56,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#false} ~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:38:56,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#false} assume !!(main1_~i2~0#1 < 6);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:38:56,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {882#false} is VALID
[2022-02-20 19:38:56,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#false} assume !(node1_~m1~0#1 != ~nomsg~0); {882#false} is VALID
[2022-02-20 19:38:56,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {882#false} ~mode1~0 := 0; {882#false} is VALID
[2022-02-20 19:38:56,096 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:38:56,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#false} assume !(0 != ~mode2~0 % 256); {882#false} is VALID
[2022-02-20 19:38:56,096 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:38:56,096 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:38:56,097 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:38:56,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume !(0 != ~mode3~0 % 256); {882#false} is VALID
[2022-02-20 19:38:56,097 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:38:56,097 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:38:56,098 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:38:56,098 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:38:56,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {882#false} check_#res#1 := check_~tmp~1#1; {882#false} is VALID
[2022-02-20 19:38:56,099 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:38:56,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {882#false} assume 0 == assert_~arg#1 % 256; {882#false} is VALID
[2022-02-20 19:38:56,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#false} assume !false; {882#false} is VALID
[2022-02-20 19:38:56,100 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:38:56,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:38:56,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532873173]
[2022-02-20 19:38:56,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532873173] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:38:56,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:38:56,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-20 19:38:56,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790876276]
[2022-02-20 19:38:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:38:56,110 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:38:56,111 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:38:56,113 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:38:56,137 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:38:56,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-20 19:38:56,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:38:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-20 19:38:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 19:38:56,164 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:38:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:38:57,551 INFO L93 Difference]: Finished difference Result 1734 states and 3292 transitions.
[2022-02-20 19:38:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-20 19:38:57,551 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:38:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:38:57,553 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:38:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3292 transitions.
[2022-02-20 19:38:57,591 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:38:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3292 transitions.
[2022-02-20 19:38:57,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3292 transitions.
[2022-02-20 19:39:00,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3292 edges. 3292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:39:00,425 INFO L225 Difference]: With dead ends: 1734
[2022-02-20 19:39:00,426 INFO L226 Difference]: Without dead ends: 812
[2022-02-20 19:39:00,435 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:39:00,439 INFO L933 BasicCegarLoop]: 1600 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, 1600 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:39:00,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:39:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states.
[2022-02-20 19:39:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812.
[2022-02-20 19:39:00,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:00,510 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:39:00,512 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:39:00,514 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:39:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:00,557 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions.
[2022-02-20 19:39:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions.
[2022-02-20 19:39:00,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:00,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:00,568 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:39:00,570 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:39:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:00,610 INFO L93 Difference]: Finished difference Result 812 states and 1533 transitions.
[2022-02-20 19:39:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions.
[2022-02-20 19:39:00,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:00,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:00,614 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:00,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:00,618 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:39:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1533 transitions.
[2022-02-20 19:39:00,661 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1533 transitions. Word has length 26
[2022-02-20 19:39:00,662 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:00,663 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1533 transitions.
[2022-02-20 19:39:00,663 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:39:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1533 transitions.
[2022-02-20 19:39:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-02-20 19:39:00,667 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:00,667 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:39:00,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-20 19:39:00,668 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times
[2022-02-20 19:39:00,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:00,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659877290]
[2022-02-20 19:39:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:00,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {5094#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {5094#true} is VALID
[2022-02-20 19:39:00,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {5094#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {5094#true} is VALID
[2022-02-20 19:39:00,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {5094#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {5094#true} is VALID
[2022-02-20 19:39:00,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {5094#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5096#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID
[2022-02-20 19:39:00,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {5096#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5097#(= |ULTIMATE.start_init_#res#1| 0)} is VALID
[2022-02-20 19:39:00,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {5097#(= |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; {5098#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID
[2022-02-20 19:39:00,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {5098#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {5095#false} is VALID
[2022-02-20 19:39:00,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {5095#false} ~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; {5095#false} is VALID
[2022-02-20 19:39:00,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {5095#false} assume !!(main1_~i2~0#1 < 6);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; {5095#false} is VALID
[2022-02-20 19:39:00,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {5095#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5095#false} is VALID
[2022-02-20 19:39:00,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {5095#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5095#false} is VALID
[2022-02-20 19:39:00,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {5095#false} ~mode1~0 := 0; {5095#false} is VALID
[2022-02-20 19:39:00,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {5095#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; {5095#false} is VALID
[2022-02-20 19:39:00,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {5095#false} assume !(0 != ~mode2~0 % 256); {5095#false} is VALID
[2022-02-20 19:39:00,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {5095#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5095#false} is VALID
[2022-02-20 19:39:00,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {5095#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; {5095#false} is VALID
[2022-02-20 19:39:00,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {5095#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; {5095#false} is VALID
[2022-02-20 19:39:00,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {5095#false} assume !(0 != ~mode3~0 % 256); {5095#false} is VALID
[2022-02-20 19:39:00,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {5095#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5095#false} is VALID
[2022-02-20 19:39:00,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {5095#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; {5095#false} is VALID
[2022-02-20 19:39:00,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {5095#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; {5095#false} is VALID
[2022-02-20 19:39:00,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {5095#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {5095#false} is VALID
[2022-02-20 19:39:00,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {5095#false} check_#res#1 := check_~tmp~1#1; {5095#false} is VALID
[2022-02-20 19:39:00,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {5095#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; {5095#false} is VALID
[2022-02-20 19:39:00,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {5095#false} assume 0 == assert_~arg#1 % 256; {5095#false} is VALID
[2022-02-20 19:39:00,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {5095#false} assume !false; {5095#false} is VALID
[2022-02-20 19:39:00,754 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:39:00,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:00,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659877290]
[2022-02-20 19:39:00,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659877290] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:00,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:00,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 19:39:00,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290432377]
[2022-02-20 19:39:00,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:00,757 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:39:00,757 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:00,757 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:39:00,776 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:39:00,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 19:39:00,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 19:39:00,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 19:39:00,778 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:39:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:04,892 INFO L93 Difference]: Finished difference Result 888 states and 1649 transitions.
[2022-02-20 19:39:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-02-20 19:39:04,893 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:39:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:04,893 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:39:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions.
[2022-02-20 19:39:04,907 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:39:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions.
[2022-02-20 19:39:04,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1649 transitions.
[2022-02-20 19:39:06,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1649 edges. 1649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:39:06,210 INFO L225 Difference]: With dead ends: 888
[2022-02-20 19:39:06,211 INFO L226 Difference]: Without dead ends: 848
[2022-02-20 19:39:06,211 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:39:06,212 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 58 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:39:06,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 6095 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:39:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states.
[2022-02-20 19:39:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 812.
[2022-02-20 19:39:06,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:06,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 848 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:39:06,237 INFO L74 IsIncluded]: Start isIncluded. First operand 848 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:39:06,238 INFO L87 Difference]: Start difference. First operand 848 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:39:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:06,272 INFO L93 Difference]: Finished difference Result 848 states and 1573 transitions.
[2022-02-20 19:39:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1573 transitions.
[2022-02-20 19:39:06,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:06,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:06,276 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 848 states.
[2022-02-20 19:39:06,278 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 848 states.
[2022-02-20 19:39:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:06,330 INFO L93 Difference]: Finished difference Result 848 states and 1573 transitions.
[2022-02-20 19:39:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1573 transitions.
[2022-02-20 19:39:06,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:06,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:06,332 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:06,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:06,335 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:39:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1517 transitions.
[2022-02-20 19:39:06,373 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1517 transitions. Word has length 26
[2022-02-20 19:39:06,373 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:06,373 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1517 transitions.
[2022-02-20 19:39:06,373 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:39:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1517 transitions.
[2022-02-20 19:39:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-02-20 19:39:06,374 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:06,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]
[2022-02-20 19:39:06,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-20 19:39:06,375 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times
[2022-02-20 19:39:06,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:06,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362669798]
[2022-02-20 19:39:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:06,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {8538#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {8538#true} is VALID
[2022-02-20 19:39:06,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {8538#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {8538#true} is VALID
[2022-02-20 19:39:06,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {8538#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {8538#true} is VALID
[2022-02-20 19:39:06,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {8538#true} assume 0 == ~r1~0; {8538#true} is VALID
[2022-02-20 19:39:06,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {8538#true} assume ~id1~0 >= 0; {8538#true} is VALID
[2022-02-20 19:39:06,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {8538#true} assume 0 == ~st1~0; {8538#true} is VALID
[2022-02-20 19:39:06,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {8538#true} assume ~send1~0 == ~id1~0; {8538#true} is VALID
[2022-02-20 19:39:06,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {8538#true} assume 0 == ~mode1~0 % 256; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {8540#(= (+ (* (- 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; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID
[2022-02-20 19:39:06,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {8540#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8539#false} is VALID
[2022-02-20 19:39:06,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {8539#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8539#false} is VALID
[2022-02-20 19:39:06,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {8539#false} ~mode1~0 := 0; {8539#false} is VALID
[2022-02-20 19:39:06,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {8539#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; {8539#false} is VALID
[2022-02-20 19:39:06,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {8539#false} assume !(0 != ~mode2~0 % 256); {8539#false} is VALID
[2022-02-20 19:39:06,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {8539#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8539#false} is VALID
[2022-02-20 19:39:06,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {8539#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; {8539#false} is VALID
[2022-02-20 19:39:06,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {8539#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; {8539#false} is VALID
[2022-02-20 19:39:06,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {8539#false} assume !(0 != ~mode3~0 % 256); {8539#false} is VALID
[2022-02-20 19:39:06,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {8539#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8539#false} is VALID
[2022-02-20 19:39:06,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {8539#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; {8539#false} is VALID
[2022-02-20 19:39:06,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {8539#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; {8539#false} is VALID
[2022-02-20 19:39:06,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {8539#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8539#false} is VALID
[2022-02-20 19:39:06,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {8539#false} check_#res#1 := check_~tmp~1#1; {8539#false} is VALID
[2022-02-20 19:39:06,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {8539#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; {8539#false} is VALID
[2022-02-20 19:39:06,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {8539#false} assume 0 == assert_~arg#1 % 256; {8539#false} is VALID
[2022-02-20 19:39:06,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {8539#false} assume !false; {8539#false} is VALID
[2022-02-20 19:39:06,528 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:39:06,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:06,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362669798]
[2022-02-20 19:39:06,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362669798] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:06,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:06,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:39:06,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115039846]
[2022-02-20 19:39:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:06,530 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:39:06,530 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:06,530 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:39:06,562 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:39:06,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:39:06,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:39:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:39:06,564 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:39:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:08,354 INFO L93 Difference]: Finished difference Result 878 states and 1619 transitions.
[2022-02-20 19:39:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:39:08,355 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:39:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:08,355 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:39:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions.
[2022-02-20 19:39:08,364 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:39:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions.
[2022-02-20 19:39:08,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions.
[2022-02-20 19:39:09,931 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:39:09,964 INFO L225 Difference]: With dead ends: 878
[2022-02-20 19:39:09,964 INFO L226 Difference]: Without dead ends: 842
[2022-02-20 19:39:09,965 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:39:09,966 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:39:09,966 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:39:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2022-02-20 19:39:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 840.
[2022-02-20 19:39:09,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:09,982 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:39:09,984 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:39:09,986 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:39:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:10,025 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions.
[2022-02-20 19:39:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions.
[2022-02-20 19:39:10,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:10,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:10,029 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:39:10,031 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:39:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:10,068 INFO L93 Difference]: Finished difference Result 842 states and 1562 transitions.
[2022-02-20 19:39:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1562 transitions.
[2022-02-20 19:39:10,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:10,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:10,070 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:10,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:10,073 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:39:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1561 transitions.
[2022-02-20 19:39:10,114 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1561 transitions. Word has length 41
[2022-02-20 19:39:10,114 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:10,114 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1561 transitions.
[2022-02-20 19:39:10,115 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:39:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1561 transitions.
[2022-02-20 19:39:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2022-02-20 19:39:10,116 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 19:39:10,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-20 19:39:10,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times
[2022-02-20 19:39:10,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:10,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259886548]
[2022-02-20 19:39:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:10,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:10,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {11987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {11987#true} is VALID
[2022-02-20 19:39:10,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {11987#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {11987#true} is VALID
[2022-02-20 19:39:10,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {11987#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {11987#true} is VALID
[2022-02-20 19:39:10,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {11987#true} assume 0 == ~r1~0; {11987#true} is VALID
[2022-02-20 19:39:10,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {11987#true} assume ~id1~0 >= 0; {11987#true} is VALID
[2022-02-20 19:39:10,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {11987#true} assume 0 == ~st1~0; {11989#(<= ~st1~0 0)} is VALID
[2022-02-20 19:39:10,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {11989#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {11989#(<= ~st1~0 0)} is VALID
[2022-02-20 19:39:10,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {11989#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {11989#(<= ~st1~0 0)} is VALID
[2022-02-20 19:39:10,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {11989#(<= ~st1~0 0)} assume ~id2~0 >= 0; {11989#(<= ~st1~0 0)} is VALID
[2022-02-20 19:39:10,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {11989#(<= ~st1~0 0)} assume 0 == ~st2~0; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {11990#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {11990#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {11991#(<= (+ ~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; {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 19:39:10,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {11991#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {11988#false} is VALID
[2022-02-20 19:39:10,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {11988#false} check_#res#1 := check_~tmp~1#1; {11988#false} is VALID
[2022-02-20 19:39:10,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {11988#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; {11988#false} is VALID
[2022-02-20 19:39:10,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {11988#false} assume 0 == assert_~arg#1 % 256; {11988#false} is VALID
[2022-02-20 19:39:10,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {11988#false} assume !false; {11988#false} is VALID
[2022-02-20 19:39:10,277 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:39:10,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:10,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259886548]
[2022-02-20 19:39:10,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259886548] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:10,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:10,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 19:39:10,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066686536]
[2022-02-20 19:39:10,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:10,278 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:39:10,279 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:10,280 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:39:10,308 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:39:10,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 19:39:10,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 19:39:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 19:39:10,310 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:39:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:13,072 INFO L93 Difference]: Finished difference Result 1224 states and 2161 transitions.
[2022-02-20 19:39:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-20 19:39:13,072 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:39:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:13,073 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:39:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions.
[2022-02-20 19:39:13,082 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:39:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions.
[2022-02-20 19:39:13,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions.
[2022-02-20 19:39:14,721 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:39:14,772 INFO L225 Difference]: With dead ends: 1224
[2022-02-20 19:39:14,772 INFO L226 Difference]: Without dead ends: 1160
[2022-02-20 19:39:14,773 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:39:14,774 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:39:14,775 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:39:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states.
[2022-02-20 19:39:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 902.
[2022-02-20 19:39:14,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:14,826 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:39:14,829 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:39:14,832 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:39:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:14,900 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions.
[2022-02-20 19:39:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions.
[2022-02-20 19:39:14,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:14,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:14,907 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:39:14,923 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:39:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:14,989 INFO L93 Difference]: Finished difference Result 1160 states and 2049 transitions.
[2022-02-20 19:39:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2049 transitions.
[2022-02-20 19:39:14,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:14,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:14,991 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:14,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:14,995 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:39:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1656 transitions.
[2022-02-20 19:39:15,041 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1656 transitions. Word has length 41
[2022-02-20 19:39:15,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:15,042 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1656 transitions.
[2022-02-20 19:39:15,042 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:39:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1656 transitions.
[2022-02-20 19:39:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-02-20 19:39:15,044 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:15,045 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:39:15,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-20 19:39:15,045 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times
[2022-02-20 19:39:15,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:15,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706290551]
[2022-02-20 19:39:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:15,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:15,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {16567#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {16567#true} is VALID
[2022-02-20 19:39:15,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {16567#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {16567#true} is VALID
[2022-02-20 19:39:15,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {16567#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {16567#true} is VALID
[2022-02-20 19:39:15,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {16567#true} assume 0 == ~r1~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {16569#(<= ~r1~0 0)} assume ~id1~0 >= 0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~st1~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {16569#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {16569#(<= ~r1~0 0)} assume ~id2~0 >= 0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~st2~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {16569#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {16569#(<= ~r1~0 0)} assume ~id3~0 >= 0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~st3~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {16569#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {16569#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {16569#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {16569#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {16569#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {16569#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {16569#(<= ~r1~0 0)} ~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {16569#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 6);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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {16569#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {16569#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {16569#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {16569#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {16569#(<= ~r1~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; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {16569#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16569#(<= ~r1~0 0)} is VALID
[2022-02-20 19:39:15,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {16569#(<= ~r1~0 0)} assume ~r1~0 >= 3; {16568#false} is VALID
[2022-02-20 19:39:15,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {16568#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {16568#false} is VALID
[2022-02-20 19:39:15,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {16568#false} check_#res#1 := check_~tmp~1#1; {16568#false} is VALID
[2022-02-20 19:39:15,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {16568#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; {16568#false} is VALID
[2022-02-20 19:39:15,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {16568#false} assume 0 == assert_~arg#1 % 256; {16568#false} is VALID
[2022-02-20 19:39:15,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {16568#false} assume !false; {16568#false} is VALID
[2022-02-20 19:39:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 19:39:15,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:15,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706290551]
[2022-02-20 19:39:15,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706290551] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:15,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:15,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:39:15,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236240011]
[2022-02-20 19:39:15,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:15,153 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:39:15,154 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:15,154 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:39:15,181 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:39:15,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:39:15,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:39:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:39:15,183 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:39:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:16,565 INFO L93 Difference]: Finished difference Result 1089 states and 1943 transitions.
[2022-02-20 19:39:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:39:16,566 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:39:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:16,566 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:39:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions.
[2022-02-20 19:39:16,572 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:39:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions.
[2022-02-20 19:39:16,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions.
[2022-02-20 19:39:17,853 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:39:17,885 INFO L225 Difference]: With dead ends: 1089
[2022-02-20 19:39:17,885 INFO L226 Difference]: Without dead ends: 963
[2022-02-20 19:39:17,885 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:39:17,886 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:39:17,886 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:39:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2022-02-20 19:39:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961.
[2022-02-20 19:39:17,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:17,980 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:39:17,982 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:39:17,985 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:39:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:18,030 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions.
[2022-02-20 19:39:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions.
[2022-02-20 19:39:18,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:18,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:18,034 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:39:18,036 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:39:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:18,077 INFO L93 Difference]: Finished difference Result 963 states and 1745 transitions.
[2022-02-20 19:39:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1745 transitions.
[2022-02-20 19:39:18,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:18,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:18,080 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:18,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:18,082 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:39:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1744 transitions.
[2022-02-20 19:39:18,132 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1744 transitions. Word has length 43
[2022-02-20 19:39:18,132 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:18,133 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1744 transitions.
[2022-02-20 19:39:18,133 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:39:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1744 transitions.
[2022-02-20 19:39:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-02-20 19:39:18,134 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:18,134 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:39:18,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-20 19:39:18,134 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times
[2022-02-20 19:39:18,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:18,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612421994]
[2022-02-20 19:39:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:18,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {20656#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {20656#true} is VALID
[2022-02-20 19:39:18,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {20656#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {20656#true} is VALID
[2022-02-20 19:39:18,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {20656#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {20656#true} is VALID
[2022-02-20 19:39:18,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {20656#true} assume 0 == ~r1~0; {20656#true} is VALID
[2022-02-20 19:39:18,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {20656#true} assume ~id1~0 >= 0; {20656#true} is VALID
[2022-02-20 19:39:18,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {20656#true} assume 0 == ~st1~0; {20658#(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:39:18,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {20658#(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; {20658#(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:39:18,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {20658#(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; {20658#(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:39:18,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {20658#(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; {20658#(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:39:18,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {20658#(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; {20659#(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:39:18,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {20659#(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; {20659#(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:39:18,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {20659#(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; {20659#(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:39:18,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {20659#(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; {20659#(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:39:18,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {20659#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main1_~i2~0#1); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(main1_~i2~0#1 < 6);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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {20660#(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; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {20660#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID
[2022-02-20 19:39:18,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {20660#(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; {20657#false} is VALID
[2022-02-20 19:39:18,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {20657#false} check_#res#1 := check_~tmp~1#1; {20657#false} is VALID
[2022-02-20 19:39:18,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {20657#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; {20657#false} is VALID
[2022-02-20 19:39:18,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {20657#false} assume 0 == assert_~arg#1 % 256; {20657#false} is VALID
[2022-02-20 19:39:18,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {20657#false} assume !false; {20657#false} is VALID
[2022-02-20 19:39:18,277 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:39:18,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:18,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612421994]
[2022-02-20 19:39:18,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612421994] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:18,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:18,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 19:39:18,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182780750]
[2022-02-20 19:39:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:18,278 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:39:18,278 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:18,278 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:39:18,316 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:39:18,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 19:39:18,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:18,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 19:39:18,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-02-20 19:39:18,317 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:39:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:20,185 INFO L93 Difference]: Finished difference Result 1146 states and 2026 transitions.
[2022-02-20 19:39:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-02-20 19:39:20,186 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:39:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:20,186 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:39:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions.
[2022-02-20 19:39:20,191 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:39:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions.
[2022-02-20 19:39:20,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions.
[2022-02-20 19:39:21,551 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:39:21,583 INFO L225 Difference]: With dead ends: 1146
[2022-02-20 19:39:21,583 INFO L226 Difference]: Without dead ends: 963
[2022-02-20 19:39:21,584 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:39:21,584 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 1528 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:39:21,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1685 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:39:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2022-02-20 19:39:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961.
[2022-02-20 19:39:21,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:21,660 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:39:21,661 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:39:21,662 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:39:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:21,705 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions.
[2022-02-20 19:39:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions.
[2022-02-20 19:39:21,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:21,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:21,708 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:39:21,710 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:39:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:21,755 INFO L93 Difference]: Finished difference Result 963 states and 1742 transitions.
[2022-02-20 19:39:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1742 transitions.
[2022-02-20 19:39:21,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:21,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:21,757 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:21,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:21,759 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:39:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1741 transitions.
[2022-02-20 19:39:21,845 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1741 transitions. Word has length 43
[2022-02-20 19:39:21,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:21,845 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1741 transitions.
[2022-02-20 19:39:21,846 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:39:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1741 transitions.
[2022-02-20 19:39:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-02-20 19:39:21,846 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:21,846 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:39:21,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-20 19:39:21,847 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times
[2022-02-20 19:39:21,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:21,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772222112]
[2022-02-20 19:39:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:21,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {24817#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {24817#true} is VALID
[2022-02-20 19:39:21,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {24817#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {24817#true} is VALID
[2022-02-20 19:39:21,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {24817#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {24817#true} is VALID
[2022-02-20 19:39:21,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {24817#true} assume 0 == ~r1~0; {24817#true} is VALID
[2022-02-20 19:39:21,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {24817#true} assume ~id1~0 >= 0; {24817#true} is VALID
[2022-02-20 19:39:21,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {24817#true} assume 0 == ~st1~0; {24817#true} is VALID
[2022-02-20 19:39:21,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {24817#true} assume ~send1~0 == ~id1~0; {24817#true} is VALID
[2022-02-20 19:39:21,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {24817#true} assume 0 == ~mode1~0 % 256; {24817#true} is VALID
[2022-02-20 19:39:21,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {24817#true} assume ~id2~0 >= 0; {24817#true} is VALID
[2022-02-20 19:39:21,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {24817#true} assume 0 == ~st2~0; {24817#true} is VALID
[2022-02-20 19:39:21,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {24817#true} assume ~send2~0 == ~id2~0; {24817#true} is VALID
[2022-02-20 19:39:21,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {24817#true} assume 0 == ~mode2~0 % 256; {24817#true} is VALID
[2022-02-20 19:39:21,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {24817#true} assume ~id3~0 >= 0; {24817#true} is VALID
[2022-02-20 19:39:21,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {24817#true} assume 0 == ~st3~0; {24817#true} is VALID
[2022-02-20 19:39:21,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {24817#true} assume ~send3~0 == ~id3~0; {24817#true} is VALID
[2022-02-20 19:39:21,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {24817#true} assume 0 == ~mode3~0 % 256; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {24819#(= (+ (* (- 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; {24819#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 19:39:21,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {24819#(= (+ (* (- 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; {24818#false} is VALID
[2022-02-20 19:39:21,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {24818#false} assume node3_~m3~0#1 != ~nomsg~0; {24818#false} is VALID
[2022-02-20 19:39:21,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {24818#false} assume !(node3_~m3~0#1 > ~id3~0); {24818#false} is VALID
[2022-02-20 19:39:21,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {24818#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {24818#false} is VALID
[2022-02-20 19:39:21,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {24818#false} ~mode3~0 := 0; {24818#false} is VALID
[2022-02-20 19:39:21,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {24818#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; {24818#false} is VALID
[2022-02-20 19:39:21,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {24818#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {24818#false} is VALID
[2022-02-20 19:39:21,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {24818#false} check_#res#1 := check_~tmp~1#1; {24818#false} is VALID
[2022-02-20 19:39:21,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {24818#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; {24818#false} is VALID
[2022-02-20 19:39:21,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {24818#false} assume 0 == assert_~arg#1 % 256; {24818#false} is VALID
[2022-02-20 19:39:21,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {24818#false} assume !false; {24818#false} is VALID
[2022-02-20 19:39:21,901 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:39:21,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:21,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772222112]
[2022-02-20 19:39:21,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772222112] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:21,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:21,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:39:21,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399818969]
[2022-02-20 19:39:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:21,902 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:39:21,902 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:21,902 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:39:21,934 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:39:21,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:39:21,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:39:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:39:21,936 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:39:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:23,682 INFO L93 Difference]: Finished difference Result 1291 states and 2237 transitions.
[2022-02-20 19:39:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:39:23,683 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:39:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:23,683 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:39:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions.
[2022-02-20 19:39:23,688 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:39:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions.
[2022-02-20 19:39:23,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions.
[2022-02-20 19:39:25,087 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:39:25,124 INFO L225 Difference]: With dead ends: 1291
[2022-02-20 19:39:25,124 INFO L226 Difference]: Without dead ends: 1108
[2022-02-20 19:39:25,125 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:39:25,126 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:39:25,129 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:39:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states.
[2022-02-20 19:39:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106.
[2022-02-20 19:39:25,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:25,279 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:39:25,280 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:39:25,281 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:39:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:25,336 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions.
[2022-02-20 19:39:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions.
[2022-02-20 19:39:25,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:25,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:25,340 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:39:25,341 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:39:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:25,397 INFO L93 Difference]: Finished difference Result 1108 states and 1953 transitions.
[2022-02-20 19:39:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1953 transitions.
[2022-02-20 19:39:25,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:25,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:25,399 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:25,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:25,401 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:39:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1952 transitions.
[2022-02-20 19:39:25,445 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1952 transitions. Word has length 43
[2022-02-20 19:39:25,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:25,445 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1952 transitions.
[2022-02-20 19:39:25,445 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:39:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1952 transitions.
[2022-02-20 19:39:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2022-02-20 19:39:25,446 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:25,446 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:39:25,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-20 19:39:25,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times
[2022-02-20 19:39:25,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:25,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256153194]
[2022-02-20 19:39:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {29624#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {29624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {29624#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {29624#true} assume 0 == ~r1~0; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {29624#true} assume ~id1~0 >= 0; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {29624#true} assume 0 == ~st1~0; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {29624#true} assume ~send1~0 == ~id1~0; {29624#true} is VALID
[2022-02-20 19:39:25,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {29624#true} assume 0 == ~mode1~0 % 256; {29624#true} is VALID
[2022-02-20 19:39:25,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {29624#true} assume ~id2~0 >= 0; {29624#true} is VALID
[2022-02-20 19:39:25,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {29624#true} assume 0 == ~st2~0; {29624#true} is VALID
[2022-02-20 19:39:25,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {29624#true} assume ~send2~0 == ~id2~0; {29624#true} is VALID
[2022-02-20 19:39:25,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {29624#true} assume 0 == ~mode2~0 % 256; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {29626#(= (+ (* (- 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; {29626#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 19:39:25,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {29626#(= (+ (* (- 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; {29625#false} is VALID
[2022-02-20 19:39:25,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {29625#false} assume node2_~m2~0#1 != ~nomsg~0; {29625#false} is VALID
[2022-02-20 19:39:25,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {29625#false} assume !(node2_~m2~0#1 > ~id2~0); {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {29625#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {29625#false} ~mode2~0 := 0; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {29625#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; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {29625#false} assume !(0 != ~mode3~0 % 256); {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {29625#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {29625#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; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {29625#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; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {29625#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {29625#false} is VALID
[2022-02-20 19:39:25,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {29625#false} check_#res#1 := check_~tmp~1#1; {29625#false} is VALID
[2022-02-20 19:39:25,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {29625#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; {29625#false} is VALID
[2022-02-20 19:39:25,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {29625#false} assume 0 == assert_~arg#1 % 256; {29625#false} is VALID
[2022-02-20 19:39:25,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {29625#false} assume !false; {29625#false} is VALID
[2022-02-20 19:39:25,494 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:39:25,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:25,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256153194]
[2022-02-20 19:39:25,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256153194] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:25,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:25,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:39:25,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498784991]
[2022-02-20 19:39:25,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:25,495 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:39:25,495 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:25,495 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:39:25,522 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:39:25,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 19:39:25,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 19:39:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 19:39:25,523 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:39:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:27,389 INFO L93 Difference]: Finished difference Result 1690 states and 2810 transitions.
[2022-02-20 19:39:27,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 19:39:27,390 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:39:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:27,390 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:39:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions.
[2022-02-20 19:39:27,397 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:39:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions.
[2022-02-20 19:39:27,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions.
[2022-02-20 19:39:28,796 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:39:28,849 INFO L225 Difference]: With dead ends: 1690
[2022-02-20 19:39:28,849 INFO L226 Difference]: Without dead ends: 1362
[2022-02-20 19:39:28,851 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:39:28,851 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:39:28,851 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:39:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states.
[2022-02-20 19:39:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1360.
[2022-02-20 19:39:29,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:29,099 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:39:29,101 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:39:29,103 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:39:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:29,180 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions.
[2022-02-20 19:39:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions.
[2022-02-20 19:39:29,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:29,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:29,185 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:39:29,187 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:39:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:29,268 INFO L93 Difference]: Finished difference Result 1362 states and 2309 transitions.
[2022-02-20 19:39:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2309 transitions.
[2022-02-20 19:39:29,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:29,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:29,270 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:29,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:29,273 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:39:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2308 transitions.
[2022-02-20 19:39:29,350 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2308 transitions. Word has length 43
[2022-02-20 19:39:29,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:29,350 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 2308 transitions.
[2022-02-20 19:39:29,351 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:39:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2308 transitions.
[2022-02-20 19:39:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-02-20 19:39:29,351 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:29,351 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:39:29,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-20 19:39:29,351 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times
[2022-02-20 19:39:29,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:29,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252438072]
[2022-02-20 19:39:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:29,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {35767#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {35767#true} is VALID
[2022-02-20 19:39:29,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {35767#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {35767#true} is VALID
[2022-02-20 19:39:29,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {35767#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#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_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~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; {35767#true} is VALID
[2022-02-20 19:39:29,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {35767#true} assume 0 == ~r1~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {35767#true} assume ~id1~0 >= 0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {35767#true} assume 0 == ~st1~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {35767#true} assume ~send1~0 == ~id1~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {35767#true} assume 0 == ~mode1~0 % 256; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {35767#true} assume ~id2~0 >= 0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {35767#true} assume 0 == ~st2~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {35767#true} assume ~send2~0 == ~id2~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {35767#true} assume 0 == ~mode2~0 % 256; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {35767#true} assume ~id3~0 >= 0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {35767#true} assume 0 == ~st3~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {35767#true} assume ~send3~0 == ~id3~0; {35767#true} is VALID
[2022-02-20 19:39:29,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {35767#true} assume 0 == ~mode3~0 % 256; {35767#true} is VALID
[2022-02-20 19:39:29,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {35767#true} assume ~id1~0 != ~id2~0; {35767#true} is VALID
[2022-02-20 19:39:29,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {35767#true} assume ~id1~0 != ~id3~0; {35767#true} is VALID
[2022-02-20 19:39:29,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {35767#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {35769#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID
[2022-02-20 19:39:29,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {35769#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {35770#(= |ULTIMATE.start_init_#res#1| 1)} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {35770#(= |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; {35771#(= |ULTIMATE.start_main1_~i2~0#1| 1)} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {35771#(= |ULTIMATE.start_main1_~i2~0#1| 1)} assume !(0 == main1_~i2~0#1); {35767#true} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {35767#true} assume !!(main1_~i2~0#1 < 6);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; {35767#true} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {35767#true} assume !(0 != ~mode1~0 % 256); {35767#true} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {35767#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35767#true} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {35767#true} assume !(0 != ~mode2~0 % 256); {35767#true} is VALID
[2022-02-20 19:39:29,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {35767#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35767#true} is VALID
[2022-02-20 19:39:29,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {35767#true} assume !(0 != ~mode3~0 % 256); {35767#true} is VALID
[2022-02-20 19:39:29,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {35767#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {35767#true} is VALID
[2022-02-20 19:39:29,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {35767#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; {35767#true} is VALID
[2022-02-20 19:39:29,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {35767#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35767#true} is VALID
[2022-02-20 19:39:29,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {35767#true} assume !(~r1~0 >= 3); {35767#true} is VALID
[2022-02-20 19:39:29,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {35767#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {35767#true} is VALID
[2022-02-20 19:39:29,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {35767#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {35772#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID
[2022-02-20 19:39:29,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {35772#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {35773#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID
[2022-02-20 19:39:29,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {35773#(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; {35774#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID
[2022-02-20 19:39:29,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {35774#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {35768#false} is VALID
[2022-02-20 19:39:29,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {35768#false} assume !false; {35768#false} is VALID
[2022-02-20 19:39:29,447 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:39:29,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:29,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252438072]
[2022-02-20 19:39:29,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252438072] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:29,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:29,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-02-20 19:39:29,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495726578]
[2022-02-20 19:39:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:29,449 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:39:29,449 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:29,449 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:39:29,477 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:39:29,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-20 19:39:29,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:29,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-20 19:39:29,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-02-20 19:39:29,478 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:39:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:36,616 INFO L93 Difference]: Finished difference Result 1883 states and 3036 transitions.
[2022-02-20 19:39:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-02-20 19:39:36,617 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:39:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 19:39:36,617 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:39:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions.
[2022-02-20 19:39:36,622 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:39:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions.
[2022-02-20 19:39:36,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1577 transitions.
[2022-02-20 19:39:37,815 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:39:37,925 INFO L225 Difference]: With dead ends: 1883
[2022-02-20 19:39:37,925 INFO L226 Difference]: Without dead ends: 1881
[2022-02-20 19:39:37,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210
[2022-02-20 19:39:37,927 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 331 mSDsluCounter, 8972 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 10503 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 19:39:37,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 10503 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 19:39:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states.
[2022-02-20 19:39:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1408.
[2022-02-20 19:39:38,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 19:39:38,326 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:39:38,327 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:39:38,328 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:39:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:38,431 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions.
[2022-02-20 19:39:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions.
[2022-02-20 19:39:38,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:38,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:38,434 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:39:38,435 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.
[2022-02-20 19:39:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 19:39:38,544 INFO L93 Difference]: Finished difference Result 1881 states and 3015 transitions.
[2022-02-20 19:39:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3015 transitions.
[2022-02-20 19:39:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 19:39:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 19:39:38,546 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 19:39:38,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 19:39:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. 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:39:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2352 transitions.
[2022-02-20 19:39:38,609 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2352 transitions. Word has length 44
[2022-02-20 19:39:38,609 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 19:39:38,609 INFO L470 AbstractCegarLoop]: Abstraction has 1408 states and 2352 transitions.
[2022-02-20 19:39:38,609 INFO L471 AbstractCegarLoop]: INTERPOLANT 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)
[2022-02-20 19:39:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2352 transitions.
[2022-02-20 19:39:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2022-02-20 19:39:38,610 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 19:39:38,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 19:39:38,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-20 19:39:38,611 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 19:39:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 19:39:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -523945775, now seen corresponding path program 1 times
[2022-02-20 19:39:38,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 19:39:38,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471204615]
[2022-02-20 19:39:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 19:39:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 19:39:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 19:39:38,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {43305#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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; {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet36#1, main2_#t~ret37#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet36#1 && main2_#t~nondet36#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet36#1;havoc main2_#t~nondet36#1; {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,758 INFO L290 TraceCheckUtils]: 4: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret33#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID
[2022-02-20 19:39:38,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {43307#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,806 INFO L290 TraceCheckUtils]: 60: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {43308#(not (= (+ (- 3) ~a5~0) 0))} is VALID
[2022-02-20 19:39:38,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {43308#(not (= (+ (- 3) ~a5~0) 0))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {43306#false} is VALID
[2022-02-20 19:39:38,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {43306#false} assume !false; {43306#false} is VALID
[2022-02-20 19:39:38,808 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:39:38,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 19:39:38,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471204615]
[2022-02-20 19:39:38,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471204615] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 19:39:38,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 19:39:38,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 19:39:38,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447149303]
[2022-02-20 19:39:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 19:39:38,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63
[2022-02-20 19:39:38,811 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 19:39:38,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 19:39:38,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 19:39:38,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-02-20 19:39:38,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 19:39:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-20 19:39:38,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-02-20 19:39:38,864 INFO L87 Difference]: Start difference. First operand 1408 states and 2352 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)